Book Review: Kolmogorov complexity and algorithmic randomness

DOI10.1090/BULL/1676MaRDI QIDQ5220394zbMATH OpenOpenAlexWikidataFDO

Authors 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 randomnessdescriptive complexityalgorithmic information theory

Mathematics Subject Classification ID

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

Cited in

(4)

• Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
• Book Reviews
• Book review of: Olle Häggström, Finite Markov chains and algorithmic applications
• Book review of: Oded Goldreich, Computational complexity: a conceptual perspective

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220394)