Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following statements are TRUE about Turing Machines?
(A) A Turing machine can simulate any algorithmic computation.
(B) Turing machines can have a finite number of states and an infinite tape.
(C) The transition function of a Turing machine can depend on the current state and the symbol being read.
(D) A Turing machine cannot recognize context-free languages.
Choose the correct answer from the options given below:
1
(A), (B), (C) Only
2
(A), (B), (D) Only
3
(A), (C), (D) Only
4
(B), (C), (D) Only