Course pages 2016–17

# Computation Theory

**Lecture notes**.**Slides**[pdf]:- lecture 1 (19 Jan)

**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.