M

Mr. Dubey • 52.49K Points
Coach 

Q. Let <M> be the encoding of a Turing machine as a string over ∑= {0, 1}. Let L = { <M> |M is a Turing machine that accepts a string of length 2014 }. Then, L is

(A) decidable and recursively enumerable
(B) undecidable but recursively enumerable
(C) undecidable and not recursively enumerable
(D) decidable but not recursively enumerable
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which among the below stated lines represent the handshaking variant usually and only controlled by the software in the handshaking process?

Q. Which has continuous transmission?

Q. Quality planning at organisational level must be done by

Q. Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union

Q. What is meant by parallel load of a shift register?

Q. What is the extraction of the meaning of utterance?

Q. How many views of the software can be represented through the Unified Modeling Language (UML)?

Q. Forward Engineering is possible for an Activity Diagram especially if the context of the diagram is ________

Q. Under what method payment is made at the time of physical delivery of goods.

Q. Which of the following term is best defined by the statement: “Derive traceability information to maximize information hiding in the design.&rd

Question analytics