A Language L Is Recursively Enumerable If Llm For Some Turing #667

A language L is recursively enumerable if L=L(M) for some turing machine M.<br /> <img src="@root_url/public/uploads/org/vu/mcqs/20453-image-title.png"><br /> Which among the following cannot be among A, B and C?

This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Introduction to Turing Machines - The Language of Turing Machine - Quiz No.2.

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

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

yes w ∈ L

no w ∉ L

M does not halt w ∉ L

None of the mentioned