Course pages 2017–18

# Computation Theory

Lecture Slides- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lectures 11 and 12 (These lectures were not delivered due to the strike. The material is still examinable.)

Here are some videos from Hackers at Cambridge explaining partial recursive functions:

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