-
Let < M > be the encoding of a Turing machine as a string over ∑ = {0, 1}. Let L = {
| M is a Turing machine that accepts a string of length 2014}. Then, L is
-
- decidable and recursively enumerable
- undecidable but recursively enumerable
- undecidable and not recursively enumerable
- decidable but not recursively enumerable
- decidable and recursively enumerable
Correct Option: B
The language is recursive enumerable and it is undecidable
