“Algorithmic Randomness: Introduction to Kolmogorov Complexity”
Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo
The topic for the Computability Learning Seminar this term will be Algorithmic Random- ness. We will be following Nies’s book, Computability and Randomness.