Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
For a statement
A language L ⊆ Σ* is recursive if there exists some Turing machine M
Which of the following conditions is satisfied for any string w?
1
If w ε L, then m accepts w and M will not halt
2
If w ∉ L, then M accepts w and M will halt by reaching at final state
3
If w ∉ L, then M halts without reaching to acceptable state
4
If w ε L, then M halts without reaching to an acceptable state