A language L is recursively enumerable if L=L(M) for some turing machine M.

Question

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

Which among the following cannot be among A, B and C?

TuteeHUB · Answer

yes  w ∈ L

TuteeHUB · Answer

no w ∉ L

TuteeHUB · Answer

M does not halt w ∉ L

TuteeHUB · Answer

None of the mentioned

1.	A language L is recursively enumerable if L=L(M) for some turing machine M.
A.	Which among the following cannot be among A, B and C?
B.	yes w ∈ L
C.	no w ∉ L
D.	M does not halt w ∉ L
E.	None of the mentioned
Answer» E.

Discussion