Q13

MCQ1 mark, −0.25

Nobody knows yet if $P=NP$ . Consider the language $L$ defined as follows.

L = \begin{cases} (0+1)^* & \text{ if } P = NP \\ \phi & otherwise \end{cases}

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 recursively enumerable or not will be known after we find out if $P=NP$

Loading…