Loading previous year questions
Theory of Computation · Turing Machines and Undecidability
Official IIT answer key · IIT Kharagpur · Audited Aug 2026
GATE CSE 2014 Set 1 Q38 · MCQ · 2 marks
Key concept
No account needed
Sit 5 related Turing Machines and UndecidabilityPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Across GATE CS, 'Turing machines and undecidability' is consistently tested through theoretical properties of computability and complexity classes. Questions primarily assess language hierarchies (Recursive vs. Recursively Enumerable), closure properties under complement and set operations, mapping reductions (A m B), and Rice's Theorem applied to TM behavior. A frequent focus is distinguishing semantic properties of languages (undecidable) from finite-step or prefix-bounded properties of machine computations (decidable).
Full Turing Machines and Undecidability guide →Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.