Lecture 11

More on the universal distribution and intro on Lovasz Local Lemma.

Tardos-Moser paper A constructive proof of the general Lovász local lemma

Lecture notes by Peter Ralli

Lecture 10

Properties of the universal distribution

Lecture Notes by Emma Cohen

Lecture 9

m(x) = 2^-K(x) as a universal semi-computable semi-measure

Lecture Notes by Sadra Yazdanbod

Lecture 8

More Prefix-Complexity, Chaitin's Omega

Lecture Notes by David Durfee

Lecture 7

Properties of K-complexity

Lecture Notes by Nathan White

Lecture 6

K complexity - prefix-free (self-delimiting) complexity

Lecture Notes by John Stewart

Lecture 5

Symmetry of Information proof finished by Arefin
Runs of zeros in random strings
Lecture Notes by Ezgi Karabulut
The proof of symmetry of information is contained in the previous lecture notes.

Lecture 4

Symmetry of Information
Arefin Huq, Lecturer
Lecture Notes by Ezgi Karabulut

Lecture 3

Using Kolmogorov complexity to prove there are lots of primes and the power of random strings.

Lecture Notes by Peter Ralli

Lecture 2

Basic definitions and properties of Kolmogorov Complexity

Lecture 1

Introduction to Randomness and Kolmogorov Complexity

Slides

Lecture notes by Ben Cousins