Algorithmic randomness : progress and prospects / edited by Johanna N. Y. Franklin, Christopher P. Porter.

Format:

Book

Contributor:

Franklin, Johanna N. Y., editor.

Porter, Christopher (Christopher P.), editor.

Association for Symbolic Logic, issuing body.

Series:

Lecture notes in logic ; 50.

Lecture notes in logic ; 50

Language:

English

Subjects (All):

Computational complexity.

Physical Description:

1 online resource (x, 359 pages) : digital, PDF file(s).

Place of Publication:

Cambridge : Cambridge University Press, 2020.

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.

Contents:

Key developments in algorithmic randomness / Johanna N.Y. Franklin and Christopher P. Porter

Algorithmic randomness in ergodic theory / Henry Towsner

Algorithmic randomness and constructive/computable measure theory / Jason Rute

Algorithmic randomness and layerwise computability / Mathieu Hoyrup

Relativization in randomness / Johanna N.Y. Franklin

Aspects of Chaitin's Omega / George Barmpalias

Biased algorithmic randomness / Christopher P. Porter

Higher randomness / Benoit Monin

Resource bounded randomness and its applications / Donald M. Stull.

Notes:

Title from publisher's bibliographic system (viewed on 08 May 2020).

ISBN:

1-108-80827-1

1-108-78171-3

OCLC:

1155832753