- Publisher's listprice GBP 125.00
-
63 262 Ft (60 250 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 6 326 Ft off)
- Discounted price 56 936 Ft (54 225 Ft + 5% VAT)
63 262 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 7 May 2020
- ISBN 9781108478984
- Binding Hardback
- No. of pages368 pages
- Size 234x157x24 mm
- Weight 640 g
- Language English
- Illustrations 5 b/w illus. 3 tables 118
Categories
Short description:
Surveys on recent developments in the theory of algorithmic randomness and its interactions with other areas of mathematics.
MoreLong 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.
MoreTable 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.
More
