Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Consider the following statements:
S1 : These exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same language.
S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1) ⊆ L(M2) is undecidable.
1
Only S1
2
Only S2
3
Both S1 and S2
4
Neither S1 and S2