请考虑以下语句：
1. The complement of every Turning decidable
language is Turning decidable
2. There exists some language which is in NP
but is not Turing decidable
3. If L is a language in NP, L is Turing decidable 以上哪个陈述是正确的?
(A)只有2
(B)只有3
(C)仅1和2
(D)仅1和3答案： (D)
解释：
1 is true: Complement of Turing decidable is Turing Decidable.
3 is true. All NP problems are Turing decidable
(See https://www.geeksforgeeks.org/np-completeness-set-1/)
2 is false: The definition of NP itself says solvable in
polynomial time using non-deterministic Turing machine. 这个问题的测验