Course pages 2011–12
Computation Theory
- Lecture notes [black and white pdf].
- List of corrections to the notes [pdf].
- Slides [colour pdf]:
- Past
exam questions:
- Computation Theory.
- Foundations of Functional Programming. (Since 2009, the last three lectures of this course have incorporated some material from a Part IB course on Foundations of Functional Programming that is no longer offered.)
Comments on the relevance of recent Tripos questions to the course.
- Additional material:
- Scooping the Loop Snooper (© Mathematical Acssociation of America), a poetic proof of the undecidability of the halting problem in the style of Dr Seuss by Geoffrey K. Pullum.
- A real Turing machine.