Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Let LN and LD denote all the languages recognized by non-deterministic and deterministic Turing machines respectively. Which of the following statements is TRUE?
1
There exists a language L such that L ∈ LN and L ∉ LD.
2
There exists a language L such that L ∈ LD and L ∉ LN.
3
For every language L, L ∈ LD if and only if L∈ LN.
4
Both A and B
5
Question Not Attempted