Book Review: Kolmogorov complexity and algorithmic randomness

DOI10.1090/bull/1676zbMath1432.00019OpenAlexW2975605982WikidataQ127204760 ScholiaQ127204760MaRDI QIDQ5220394

J. Maurice Rojas

Publication date: 20 March 2020

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/bull/1676

zbMATH Keywords

algorithmic information theoryalgorithmic randomnessdescriptive complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Descriptive complexity and finite models (68Q19) External book reviews (00A17) Algorithmic randomness and dimension (03D32)

This page was built for publication: Book Review: Kolmogorov complexity and algorithmic randomness