Consider the following statements. I. The complement of every Turing decidable…
GATE · 2015 · CS · Set 2 · Computer Science & IT
Consider the following statements.
I. The complement of every Turing decidable language is Turing decidable
II. There exists some language which is in NP but is not Turing decidable
III. If L is a language in NP, L is Turing decidable
Which of the above statements is/are true?
- A.
Only II
- B.
Only III
- C.
Only I and II
- D.
Only I and III
Attempted by 144 students.
Sign up free to check your answer
Sign up freeLoading lesson…