Lecture 9

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

Scribe Notes by Aleck Johnsen

Lecture 8

Chaitin's Omega, Lower Semi-Computable Semi-Measures

Scribe notes by Sam Carton

Lecture 7

Basic Properties of Prefix-Free K complexity

Scribe Notes by Arefin Huq

Lecture 6

Random Strings are hard for the halting problem. Start of Prefix-free complexity.

Scribe Notes by Kai Hayashi 

Lecture 5

Properties of C

Scribe Notes by Aleck Johnsen

Lecture 4

Statistical Properties of Random Strings, C as a function from integers to integers

Scribe Notes by Sam Carton

Lecture 3

k-random strings, symmetry of information and an application to logic

Scribe Notes by Fred Robertson

Richard Lipton post on random axioms