github.com/dzyim/ilya-sutskever-recommended-reading ↗

Shane Legg

“If you really learn all of these, you'll know 90% of what matters today.”

A. Shen, V. A. Uspensky, N. Vereshchagin

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).

Peter D. Grünwald

Ilya Sutskever's Carmack reading list includes 'A Tutorial Introduction to the Minimum Description Length Principle' by Peter Grünwald — a tutorial paper rather than a standalone book. The catalogue entry uses Grünwald's full MIT Press book of the same subject (paperback ISBN 9780262529631; hardcover 9780262072816, out of print), of which the listed tutorial is the short-form version. Included with this caveat for transparency.