-
Consider the following languages :
L1 = {| M takes at least 2016 steps on some input};
L2 = {| M takes at least 2016 steps on all inputs} and
L3 = {| M accepts ε}; where for each Turing machine M, denotes a specific encoding of M. Which one of the following is TRUE ?
-
- L1 is recursive and L2, L3 are not recursive
- L2 is recursive and L1, L3 are not recursive
- L1, L2 are recursive and L3 is not recursive
- L1, L2, L3 are recursive
- L1 is recursive and L2, L3 are not recursive
Correct Option: C
NA
