64 685
Assignments Done
Successfully Done
In September 2018

Answer to Question #38612 in Other Math for Sujata Roy

Question #38612
Nobody knows yet if P = NP. Consider the language L defined as follows:
L=(0+1)* if P = NP
L=j otherwise
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
Expert's answer

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!


Assignment Expert
17.02.14, 20:07

Dear Sujata Roy

You're welcome. We are glad to be helpful.
If you liked our service please press like-button beside answer field. Thank you!

Sujata Roy
10.02.14, 21:43

Thank you.

Leave a comment

Ask Your question

Privacy policy Terms and Conditions