Algorithmic randomness and computability theory inhabit a crossroads between mathematics and computer science, providing a rigorous framework for understanding randomness in infinite sequences and ...

This course gives an introduction to the mathematical foundations of computation. The course will look at Turing machines, universal computation, the Church-Turing thesis, the halting problem and ...