Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn theory of computation
·
Module 10
Undecidability and Reducibility
1
Diagonalization and the Limits of Enumerability
Use a diagonalization argument to prove that not all languages are recursively enumerable.
2
The Halting Problem: Undecidability Proof
Define the Halting Problem (A_TM) and prove its undecidability using a proof by contradiction.
3
Mapping Reducibility for Proving Undecidability
Explain the technique of mapping reducibility as a method for proving undecidability.
4
Undecidability through Reductions from the Halting Problem
Apply reductions from the Halting Problem to prove that other problems about TMs are undecidable.
5
Undecidability of Post's Correspondence Problem
State the undecidability of the Post's Correspondence Problem (PCP).
6
Undecidability of CFL Equivalence
Explain why the equivalence problem for Context-Free Languages is undecidable.
Previous module
Computability and the Chomsky Hierarchy
Next module
Introduction to Computational Complexity