Algorithmic Randomness

Surveys on recent developments in the theory of algorithmic randomness and its interactions with other areas of mathematics.

This volume surveys many exciting recent developments in the field of algorithmic randomness and its interactions with other areas of mathematics, presenting a unified view of the theory. It will be a valuable reference for specialists and an excellent entry point for graduate students and other newcomers to the field.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.