Projects and Assignments in Pure Mathematics

Algorithmic randomness

This project requires a basic knowledge of computability theory, such as derivable from MATH3163: Computability and Unsolvability, or the book 'Computability Theory' by S. Barry Cooper. Building on this, the student should give a basic introduction to the theory of random real numbers, describing the various approaches and motivations, and go on to focus on a selection of results/more advanced topics in the area.

Prerequisites: MATH 3163 Computability and Unsolvability

Books

S. Barry Cooper: Computability Theory, Chapman & Hall, 2004
Andre Nies: Computability and Randomness, to appear Oxford University Press, Feb. 2009 - downloadable from: http://www.cs.auckland.ac.nz/~nies/


Pure projects homepage