-
Nobody knows yet, if P = NP. Consider the language L de as follows:
Which of the following statements is true?
-
- L is recursive
- L is recursively enumerable but not recursive
- L is not recursively enumerable
- Whether L is recursive or not will be known after we find out if P = NP
- L is recursive
Correct Option: A
Consider the case where L = (0 + 1)*
Here the answer of any turing machine would be yes since some output is displayed.
Consider the case where L = φ
Here, the answer of any turing machine would be No since no output is displayed.
This type of behaviour is displayed by the recursive language and therefore, the language L is recursive language and therefore, the language L is recursive.
