BOOK · [4958]
Kolmogorov Complexity and Algorithmic Randomness
A. Shen, V. A. Uspensky, N. Vereshchagin
Science
An American Mathematical Society monograph (Mathematical Surveys and Monographs, vol. 220) giving a rigorous textbook treatment of Kolmogorov complexity, algorithmic randomness, and algorithmic statistics — how short programs / good compressors relate to randomness and to good models of data. It sits on Ilya's reading list as the canonical reference for the compression-as-intelligence view that runs through his thinking about why large models generalize.
Endorsed By
1 PERSON-
Ilya Sutskever
Listed on Ilya Sutskever's reading list to John Carmack as 'Kolmogorov Complexity and Algorithmic Randomness' (the list points readers to the algorithmic-statistics material in the book). Genuine published book; ISBN is for the AMS edition (Mathematical Surveys and Monographs, vol. 220, 2017).
Found on
1 SOURCE- github.com · ilya sutskever recommended reading reading list