Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following is/are NOT recursively enumerable languages?
(choose the most appropriate choices)
1
L(M) has atmost 20 strings.
2
L(M) = {0}
3
L(M) is recognized by the Turing machine having an even number of steps.
4
L(M) is a subset of \(\mathop \sum \nolimits_{}^{}\)*