Algorithmic Randomness
Progress and Prospects
Part of Lecture Notes in Logic
- Editors:
- Johanna N. Y. Franklin, Hofstra University, New York
- Christopher P. Porter, Drake University, Iowa
- format: Adobe eBook Reader
- isbn: 9781108808279
Find out more about Cambridge eBooks
Adobe eBook Reader
Other available formats:
Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact [email protected] providing details of the course you are teaching.
-
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.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- format: Adobe eBook Reader
- isbn: 9781108808279
- contains: 5 b/w illus. 3 tables
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.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×