1.

A language L is recursively ennumerable if L=L(M) for some turing machine M.Which among the following cannot be among A, B and C?

A. yes w ∈ L
B. no w ∉ L
C. M does not halt w ∉ L
D. None of the mentioned
Answer» E.


Discussion

No Comment Found

Related MCQs