Which of the following is true for The Halting problem? – McqOptions

MCQOPTIONS

1.	Which of the following is true for The Halting problem?
A.	It is recursively enumerable
B.	It is undecidable
C.	It is recursively enumerable and undecidable
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

No Comment Found

Related MCQs

With reference to binary strings, state true or false:Statement: For any turing machine, the input alphabet is restricted to {0,1}.
Which of the following is true for The Halting problem?
Statement: If L id R.E., Lc needs to be R.E. Is it correct?
7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}
Which of the following are decidable problems?
Which of the following technique is used to find whether a natural language isn t recursive enumerable?