AIT Lecture notes

[Itisan Halias]

Hello everyone. With the goal of learning Algorithmic Information Theory, I have worked on some lecture notes. My objective was to formalize several important classical results including, among others: the Kraft-Chaitin inequality, Levin’s Coding Theorem, the Symmetry of Information, and Solomonoff’s Completeness Theorem. I also included a chapter on Algorithmic Randomness covering characterizations via Schnorr’s Theorem, the Miller-Yu Theorem, and unpredictability through Martingales. I am sharing this in case it might interest someone here.

www.ait-notes.com