Answer to Question #38608 in Math for Sujata Roy

Question #38608
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
1
Expert's answer
2014-01-28T01:42:45-0500
The answer to the question is available in the PDF file https://www.assignmentexpert.com/https://www.assignmentexpert.com/homework-answers/mathematics-answer-38608.pdf

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

Assignment Expert
31.01.14, 19:22

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!

Sujata Roy
29.01.14, 20:33

Thank you.

Leave a comment

LATEST TUTORIALS
APPROVED BY CLIENTS