Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Which of the following statements is/are TRUE?
I. Every recursive language is also a recursively enumerable language.
II. Recursive languages are Turing-recognizable.
III. Recursive languages are accepted by a Turing machine that always halts.
1
I and II only
2
I and III only
3
II and III only
4
I, II, and III