| Lecture 1 - Proof Techniques - Induction and Contradiction | 1 | 0 |
| Lecture 2 - Diagonalization and Countability | 2 | 0 |
| Lecture 3 - Sets, Relations, and Functions | 3 | 0 |
| Lecture 4 - Asymptotic Notation and Growth Rates | 4 | 0 |
| Lecture 5 - Finite Automata - DFAs and NFAs | 5 | 1 |
| Lecture 6 - Regular Expressions and Closure Properties | 6 | 1 |
| Lecture 7 - The Pumping Lemma and Nonregular Languages | 7 | 1 |
| Lecture 8 - Context-Free Grammars and Pushdown Automata | 8 | 1 |
| Lecture 9 - Turing Machines and the Church-Turing Thesis | 9 | 2 |
| Lecture 10 - Decidability and Recognizability | 10 | 2 |
| Lecture 11 - The Halting Problem | 11 | 2 |
| Lecture 12 - Reductions and Rice's Theorem | 12 | 2 |
| Lecture 13 - Time Complexity and the Class P | 13 | 3 |
| Lecture 14 - NP and Polynomial-Time Verifiers | 14 | 3 |
| Lecture 15 - NP-Completeness and the Cook-Levin Theorem | 15 | 3 |
| Lecture 16 - Classic NP-Complete Reductions | 16 | 3 |
| Lecture 17 - coNP and Space Complexity | 17 | 3 |
| Lecture 18 - PSPACE and Savitch's Theorem | 18 | 3 |
| Lecture 19 - The Hierarchy Theorems | 19 | 3 |