Course pages 2016–17
Computation Theory
- Lecture notes.
- Slides [pdf]:
- lecture 1 (19 Jan)
- lecture 2 (24 Jan)
- lecture 3 (26 Jan)
- lecture 4 (31 Jan)
- lecture 5 (3 Feb)
- lecture 6 (7 Feb)
- lecture 7 (9 Feb)
- lecture 8 (14 Feb)
- lecture 9 (16 Feb)
- lecture 10 (21 Feb)
- lecture 11 (23 Feb)
- lecture 12 (28 Feb)
- Exercise sheet.
- 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.)
- Additional material:
- Scooping the Loop Snooper (© Mathematical Association 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.