Let INFINITETM {< M > | M is a TM that accepts an infinite number of strings} Prove whether INFINITETm is decidable or u
Posted: Mon May 02, 2022 12:03 pm
- Let Infinitetm M M Is A Tm That Accepts An Infinite Number Of Strings Prove Whether Infinitetm Is Decidable Or U 1 (23.03 KiB) Viewed 42 times
otherwise don't try to attempt.
Subject: Theory of Computations.
Theory of Computations is to check that it accept an infinite
number of strings
Let INFINITETM {< M > | M is a TM that accepts an infinite number of strings} Prove whether INFINITETm is decidable or undecidable.