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
Statement 1: If a language is decidable then every proper subset of that language is decidable.
Statement 2: Set of the languages that can be recognized by TM is uncountable.
Which of the following option is correct?
1
Statement 1 and Statement 2 both are true.
2
Statement 1 is not true and Statement 2 is true.
3
Statement 1 is true and Statement 2 is not true.
4
Statement 1 and Statement 2 both are not true.