Which of the following statements are undecidable?For a given Turing M – McqOptions

MCQOPTIONS

1.	Which of the following statements are undecidable? For a given Turing Machine M,
A.	does M halt on an empty input tape
B.	does M halt for anly inputs at all?
C.	is L(M) regular? Context free? Turing decidable?
D.	all of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

Can a Modified PCP problem be reduced to PCP?
State true or false:<br>Statement: The difference between PCP and MPCP is that in MPCP, a solution is required to start with the first string on each list.
Which of the following statements are undecidable?<br>For a given Turing Machine M,
Which of the following is incorrect according to rice theorem?<br>Let S be a set of language hat is non trivial:
Fill in the blank with reference to Rice s theorem.<br>For any non-trivial property of __________ no general or effective method can decide whether an algorithm computes it with that property.
According to the rice s theorem, If P is a non trivial property, Lp is :