Question

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

Answer 1

(D) Only I and III is the answer

Answer 2

option D is the correct answer

CharmingHeart19☃️