Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)

Book Review

The AMS does not provide abstracts of book reviews. You may download the entire review from the links below.

MathSciNet review: 4076538
Full text of review: PDF   This review is available free of charge.
Book Information:

Authors: Alexander Shen, Vladimir A. Uspensky and Nikolay K. Vereshchagin
Title: Kolmogorov complexity and algorithmic randomness
Additional book information: Mathematical Surveys and Monographs, Vol. 220, American Mathematical Society, Providence, RI, 2017, xviii+511 pp., ISBN 9781470431822

References [Enhancements On Off] (What's this?)


Review Information:

Reviewer: J. Maurice Rojas
Affiliation: Texas A&M University, College Station, Texas
Journal: Bull. Amer. Math. Soc. 57 (2020), 339-346
Published electronically: September 23, 2019
Additional Notes: The reviewer is partially supported by NSF grants CCF-1409020 and CCF-1900881, and by NSF REU grant DMS-1757872.
Review copyright: © Copyright 2019 American Mathematical Society