Decidability — Study Resources & PYQs

Decidability

Estimated study time: 54 minutes

Study resources

Decidability & Undecidability (Article) — Decidable vs undecidable problems: what it means for a language to be recursive vs recursively enumerable.
Undecidability & Reducibility (Article) — Reduction technique: proving a new problem undecidable by reducing the halting problem to it; Rice's Theorem.

Decidability previous year questions

a) Differentiate between recursive language and recursively enumerable languages? b) Discuss solvable, semi solvable and unsolvable problems?
Write short notes on the following: (a) Decidability (b) Context Free Grammar (c) Ambiguous Grammar (d) Non - Ambiguous Grammar.

Taught in these subjects

Theory of Computation — CST-3504 · Government College of Engineering and Technology, Jammu

Open on CachedInfo