# 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

And

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

L=(0+1)* if P = NP

And

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 orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert17.02.14, 20:07Dear 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 Roy10.02.14, 21:43Thank you.

## Leave a comment