Consider the following statements. I. The complement of every Turing decidable…

PYQ GATE 2015

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?

  1. A.

    Only II

  2. B.

    Only III

  3. C.

    Only I and II

  4. D.

    Only I and III

Attempted by 164 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…