Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possible along with some other inputs) is decidable
B. The language of codes for TM's M that when started with blank tape, eventually write a 1 somewhere on the tape is undecidable
C. The language accepted by a TM M is L (M) is always recursive
D. Post's correspondence problem is undecidable
Choose the correct answer from the options given below:
1
A, B and C only
2
B, C and D only
3
A and C only
4
B and D only