
Algorithmic Randomness
Progress and Prospects
Cambridge University Press
Published on 7. May 2020
Book
Hardback
368 pages
978-1-108-47898-4 (ISBN)
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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Product notice
sewn/stitched
Cloth over boards
Illustrations
Worked examples or Exercises; 3 Tables, black and white; 1 Halftones, black and white; 4 Line drawings, black and white
Dimensions
Height: 233 mm
Width: 156 mm
Thickness: 26 mm
Weight
656 gr
ISBN-13
978-1-108-47898-4 (9781108478984)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

E-Book
04/2020
Cambridge University Press
€100.99
Available for download
Persons
Editor
Hofstra University, New York
Drake University, Iowa
Content
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.