Let 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

undecidable but recursively enumerable

decidable and recursively enumerable

undecidable but recursively enumerable

undecidable and not recursively enumerable

decidable but not recursively enumerable

Mr. Dubey • 100.69K Points
Coach

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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution