- Turing Machines
- The Church-Turing Thesis
- The Unsolvability of the Halting Problem
- Decidable & Semidecidable Languages
- Decidability & Undecidability Proofs
- Decidability of Languages That Do Not (Directly) Ask Questions about Turing Machines
- Unrestricted Grammars
- Context-Sensitive Languages & the Chomsky Hierarchy
- Computable Functions
- Summary & References