Nobody knows yet if P = NP. Consider the language L defined as
follows
L=(0 + 1)* if P = NP
= φ otherwise
Which of the following statements is true?
(A) L is recursive
(B) L is recursively enumerable but not recu
(C) L is not recursively enumerable
(D) Whether L is recursive or not will be known after we find out if
P = NP
The answer to the question is available in the PDF file https://assignmentexpert.com/https://assignmentexpert.com/homework-answers/mathematics-answer-38608.pdf
Comments
Dear Sujata Roy. You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!
Thank you.
Leave a comment