Algorithmic Randomness : Progress and Prospects Hardback
Edited by Johanna N. Y. (Hofstra University, New York) Franklin, Christopher P. (Drake University, Iowa) Porter
Part of the Lecture Notes in Logic series
Hardback
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.
Information
-
Only a few left - usually despatched within 24 hours
- Format:Hardback
- Pages:368 pages, Worked examples or Exercises; 3 Tables, black and white; 1 Halftones, black and white; 4
- Publisher:Cambridge University Press
- Publication Date:07/05/2020
- Category:
- ISBN:9781108478984
Information
-
Only a few left - usually despatched within 24 hours
- Format:Hardback
- Pages:368 pages, Worked examples or Exercises; 3 Tables, black and white; 1 Halftones, black and white; 4
- Publisher:Cambridge University Press
- Publication Date:07/05/2020
- Category:
- ISBN:9781108478984
