Explore Key Concepts
Dive into the fascinating world of decidability theory through interactive visualizations and examples
Algorithms
Formal definition and historical context
Explore the Church-Turing thesis and understand what makes a procedure algorithmic.
Decidability
Understanding decidable problems
Learn about recursive and recursively enumerable languages and their properties.
Language Classes
Regular, context-free, and beyond
Discover which language classes are decidable and the proofs behind these classifications.
Halting Problem
The famous undecidable problem
Understand why the halting problem is undecidable and its implications for computing.
Post Correspondence
A fascinating undecidable puzzle
Learn about the Post Correspondence Problem and why it's important in computability theory.
Turing Machine
Interactive Turing machine simulator
Experiment with an interactive Turing machine simulator to understand undecidability concepts.
Interactive Examples
Visualize undecidable problems
Explore interactive simulations of famous undecidable problems and their proofs.