The lecture log containing a brief entry for each lecture (topics covered) can be viewed by clicking here.

The lecture notes will be linked soon after they are handed out:

- General introduction (Note 1)
- Turing's thesis (Note 2)
- Turing machines (Note 3)
- Bells and Whistles (Note 4)
- Random Access Machines (Note 5)
- Universal Turing machines (Note 6)
- The halting problem (Note 7)
- The fallout (Part 1) (Note 8)
- The fallout (Part 2) (Note 9)
- Computing against the clock (Note 10)
- More on reductions; nondeterministic computation (Note 11)
- Cook's theorem (Note 12)
- Tough nuts (Note 13)
- Logic and Complexity (Note 14)
- The Turing machine simulator (Appendix A)
- Simulation of a RAM by a Turing machine (Appendix B)
- Simulation of a Turing machine by a RAM (Appendix C)