Q. 34 Consider the following statements
1. The complement of every Turning decidable language is Turning decidable 2. There exists some language which is in NP but is not Turing decidable 3. If L is a language in NP, L is Turing decidable
(A) Only II
(B) Only III
(C) Only I and II
(D) Only I and III
Answer: (D)
Explanation:
