Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Consider the properties of recursively enumerable sets:
(A) Finiteness
(B) Context Freedom
(C) Emptiness
Which of the following is true?
1
Only (A) and (B) are not decidable
2
Only (B) and (C) are not decidable
3
Only (C) and (A) are not decidable
4
All (A), (B) and (C) are not decidable