Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which of the following statement is true?
S1: The power of a multi-tape Turing machine is greater than the power of a single tape Turing machine.
S2: Every non-deterministic Turing machine has an equivalent deterministic Turing machine1
S1
2
S2
3
Both S1 and S2
4
None of the options