Algorithmic Randomness
Algorithmic Randomness
£125.00
GBPThe 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.
- Synthesizes a range of results previously scattered across various journal articles
- Includes an introductory survey targeted at newcomers to the field
- Details the interaction between algorithmic randomness and various areas of classical mathematics as well as computable analysis and areas of theoretical computer science
Product details
May 2020Hardback
9781108478984
368 pages
234 × 157 × 24 mm
0.64kg
5 b/w illus. 3 tables
Available
Table of Contents
- 1. Key developments in algorithmic randomness Johanna N. Y. Franklin and Christopher P. Porter
- 2. Algorithmic randomness in ergodic theory Henry Towsner
- 3. Algorithmic randomness and constructive/computable measure theory Jason Rute
- 4. Algorithmic randomness and layerwise computability Mathieu Hoyrup
- 5. Relativization in randomness Johanna N. Y. Franklin
- 6. Aspects of Chaitin's Omega George Barmpalias
- 7. Biased algorithmic randomness Christopher P. Porter
- 8. Higher randomness Benoit Monin
- 9. Resource bounded randomness and its applications Donald M. Stull
- Index.
