Algorithmic Randomness: Progress and Prospects

Johanna N. Y. Franklin · Christopher P. Porter

мај 2020. · Lecture Notes in Logic 50. књига · Cambridge University Press

О овој е-књизи

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.

О аутору

Johanna N. Y. Franklin is an Associate Professor at Hofstra University in Hempstead, NY. She earned her Ph.D. from the Group in Logic and the Methodology of Science at the University of California, Berkeley and has held postdoctoral positions in Singapore, Canada, and the United States.

Christopher P. Porter is an Assistant Professor of Mathematics at Drake University in Des Moines, IA. After receiving his Ph.D. in the joint program in mathematics and philosophy at the University of Notre Dame, Porter completed postdoctoral positions at the University of Paris 7 and the University of Florida.