zbMATH — the first resource for mathematics

Algorithmic randomness. Progress and prospects. (English) Zbl 07191388
Lecture Notes in Logic 50. Cambridge: Cambridge University Press; Ithaca, NY: Association of Symbolic Logic (ASL) (ISBN 978-1-108-47898-4/hbk; 978-1-108-78171-8/ebook). x, 359 p. (2020).
Publisher’s description: The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field.
03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
03D32 Algorithmic randomness and dimension
68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)
00B15 Collections of articles of miscellaneous specific interest
Full Text: DOI