adplus-dvertising
frame-decoration

Question

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: (d).None of the mentioned

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. 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?

Similar Questions

Discover Related MCQs

Q. Which of the following regular expression resembles the given diagram?

Q. d(q,X)=(r,Y,D) where D cannot be:

Q. The following turing machine acts like:

Q. What does the following transition graph shows:

Q. In one move a turing machine will:

Q. A turing machine is a

Q. A turing machine operates over:

Q. Which of the functions are not performed by the turing machine after reading a symbol?

Q. ‘a’ in a-machine is :

Q. Which of the problems were not answered when the turing machine was invented?

Q. The ability for a system of instructions to simulate a Turing Machine is called _________

Q. Turing machine can be represented using the following tools:

Q. Which of the following is false for an abstract machine?

Q. Fill in the blank with the most appropriate option.
Statement: In theory of computation, abstract machines are often used in ___________ regarding computability or to analyze the complexity of an algorithm.

Q. State true or false:
Statement: RAM model allows random access to indexed memory locations.

Q. A turing machine that is able to simulate other turing machines:

Q. Which of the problems are unsolvable?

Q. Which of the following a turing machine does not consist of?

Q. The value of n if turing machine is defined using n-tuples:

Q. If d is not defined on the current state and the current tape symbol, then the machine ______