Nobody knows yet if P = NP. Consider the language L defined as follows : Which…
GATE · 2003 · CS
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
Attempted by 56 students.
Sign up free to check your answer
Sign up freeLoading lesson…