Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

Algorithmic information theory as a book category covers works that define and analyze the information content of individual objects in terms of the length of the shortest computer program that produces them, bringing together ideas from Kolmogorov complexity, Chaitin’s algorithmic randomness, Solomonoff induction/algorithmic probability, and universal Turing machines. Books in this category typically develop the mathematical foundations (descriptional complexity, incompressibility, coding theorems, links and contrasts with Shannon information), explore consequences for probability, inference, and computability, and discuss applications to data compression, machine learning, complexity theory, and the philosophy of information and mathematics. They range from rigorous, proof-oriented monographs for graduate students and researchers to more conceptual treatments aimed at advanced undergraduates and interdisciplinary readers interested in the limits of description, predictability, and formal notions of randomness.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.