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?
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? Correct Answer Only I and III
Statement I: TRUE
A decision problem is a problem that can be posed as a yes or no. If we can decide a problem, then its complement is also decidable. So, given statement is true.
Statement II: FALSE
NP class problems are the problems which can be solved in polynomial time using non-deterministic machine. None of the NP class problem is undecidable. So, this statement is incorrect
Statement III: TRUE
As it is explained in option II none of the NP class problem is undecidable. So, given statement is correct.
মোঃ আরিফুল ইসলাম
Feb 20, 2025