Let PRIMETM = {< M > | M is a Turing machine that accepts a prime number of strings} Prove whether PRIMETM is decidable
Posted: Mon May 02, 2022 12:03 pm
- Let Primetm M M Is A Turing Machine That Accepts A Prime Number Of Strings Prove Whether Primetm Is Decidable 1 (24.29 KiB) Viewed 32 times
otherwise don't try to attempt
Let PRIMETM = {< M > | M is a Turing machine that accepts a prime number of strings} Prove whether PRIMETM is decidable or undecidable.