Computer Sciences > Gate 2016 Set-2 > Turing Machine
Consider the following languages.
L1 = {(M) | M takes at least 2016 steps on some input},
L2 = {(M) | M takes at least 2016 steps on all inputs} and
L3 = {(M) | M accepts ε},
where for each Turing machine M, denotes a specific encoding of M. Which one of the following is TRUE?
L1 = {(M) | M takes at least 2016 steps on some input},
L2 = {(M) | M takes at least 2016 steps on all inputs} and
L3 = {(M) | M accepts ε},
where for each Turing machine M, denotes a specific encoding of M. Which one of the following is TRUE?
Correct : Turing Machine
Total Unique Visitors
Loading......