62:461 Theory of Computation [Richards]

Prerequisite: 62:261 MATH.

An introduction to computability including Turing computable, abacus computable and recursive functions and the relation between them. Aimed at Computer Science students interested in an analysis of the capabilities of machine computation and Mathematics students interested in what mathematics says about the calculation process.

3 lecture hours per week, one term.

Instructor: Gwynfor Richards