December 17, 2025
An Introduction to Kolmogorov Complexity and Its Applications
Notes
The standard comprehensive reference on Kolmogorov complexity. Essential for understanding Solomonoff induction.
Browse posts by tag
The standard comprehensive reference on Kolmogorov complexity. Essential for understanding Solomonoff induction.
Later work on convergence properties of Solomonoff induction.
Cryptographic theory assumes random oracles with infinite output. We have 256 bits. This paper explores how we bridge that gap, and what it means that we can.
The optimal predictor is incomputable. What we can learn from it anyway.