Skip to main content
Free carbon-neutral shipping over $39.99  ·  Thousands of books on sale — sale ends soon

Algorithmic Randomness

by Johanna N. Y. Franklin, Christopher P. Porter

Cambridge University Press

Hardcover 368 pages English May 07, 2020

(No reviews yet) Write a Review
Millions of titlesEvery book you're looking for
Carbon-neutral shippingFree on orders over $39.99
Fast shipping worldwideDelivered to your door
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.
Author:
Johanna N. Y. Franklin, Christopher P. Porter
Publisher:
Cambridge University Press
Publication Date:
May 07, 2020
Number of pages:
368 pages
Language:
English
Binding:
Hardcover
ISBN-10:
1108478980
ISBN-13:
9781108478984