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
Similar Questions
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Choose the word that is opposite in meaning to the word “coherent”.
Total Unique Visitors
Loading......