![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Let <M> be the encoding of a Turing machine as a string over ∑= {0, 1}. Let L = { <M> |M is a Turing machine that accepts a string of length 2014 }. Then, L is |
A. | decidable and recursively enumerable |
B. | undecidable but recursively enumerable |
C. | undecidable and not recursively enumerable |
D. | decidable but not recursively enumerable |
Answer» B. undecidable but recursively enumerable |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet