Limit search to available items
Book Cover
E-book

Title Algorithmic randomness : progress and prospects / edited by Johanna N.Y. Franklin, Christopher P. Porter
Published Cambridge, United Kingdom ; New York, NY : Cambridge University Press, 2020
©2020

Copies

Description 1 online resource
Series Lecture notes in logic
Lecture notes in logic.
Summary 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
Notes Online resource; title from digital title page (viewed on May 29, 2020)
Subject Computational complexity.
Complejidad computacional
Computational complexity
Form Electronic book
Author Franklin, Johanna N. Y., editor
Porter, Christopher (Christopher P.), editor.
ISBN 9781108781718
1108781713
9781108808279
1108808271