Consider the following statements.I. The complement of every Turing decidable language is Turing decidableII. There exists some language which is in NP but is not Turing decidableIII. If L is a language in NP, L is Turing decidableWhich of the above statements is/are true?

Question

Examsnet · Accepted Answer

Correct Answer is : Only I and III

GATE Computer Science (CS) 2015 Shift 2 Solved Paper