GATE | GATE-CS-2003 | Question 90

Nobody knows yet if P = NP. Consider the language L defined as follows :
Which of the following statements is true ?
(A) L is recursive
(B) L is recursively enumerable but not recursive
(C) L is not recursively enumerable
(D) Whether L is recursive or not will be known after we find out if P = NP

Answer: (A)

Explanation: Answer is A. in both case(P = NP or P != NP) L is regular, so L is recursive.

Thanks to Vikrant for the above explanation.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.