ENGLISH

Algorithmic randomness: progress and prospects

By Franklin , Johanna N. Y.; Porter , Christopher P (ed.)

Book information

Publisher
Cambridge University Press
Year
2020
ISBN
9781108478984, 9781108781718, 1108781713
Language
english
Format
PDF
Filesize
2 MB (1760865 bytes)
Series
Lecture notes in logic
Pages
370\370
Library
kolxo3
Time added
2020-10-11 07:46:10
Computational complexity

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.

Similar books