Department of Computer Science and Technology

Course pages 2017–18

Computation Theory

Lecture Slides

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.