GATE | GATE-CS-2015 (Set 2) | Question 65

Consider the following statements:

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

Which of the above statements is/are True?

(A)

Only 2

(B)

Only 3

(C)

Only 1 and 2

(D)

Only 1 and 3

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News