Computation Theory
Principal lecturer: Dr Ken Moody (km@cl.cam.ac.uk)
Taken by: Part IB, Part II (General), Diploma
Syllabus
Study guide for this course in pdf
A supervisor's guide for the course is available from Lise Gough (or send an e-mail request to me)
Turing machine programming examples: intro,
prize (with a proof of
uniqueness of the function f)
Here is a solution to the exercise on the intersection of recursively enumerable sets
Past exam questions,
also classified by course section with comments (and one or two solutions)
IB | II(G) | Dip
Page last updated at 22:05.00 on 20/2/2001
by Ken Moody
(km@cl.cam.ac.uk)