| Num. | Topics | Files |
| 1 | Circuits | Notes |
| 2 | Finite automata | Notes |
| 3 | Nondeterministic finite automata | Notes |
| 4 | Limitations of finite automata | Notes |
| 5 | Turing machines | Notes |
| 6 | Turing decidable and recognizable languages | Notes |
| 7 | Reductions and undecidability | Notes |
| 8 | Time complexity | Notes |
| 9 | The classes P and NP | Notes |
| 10 | SAT is NP-hard | Notes |
| 11 | Randomized computation | Notes |
| 12 | Space complexity | Notes |
| 13 | Space complexity | Notes |