Algorithmic Randomness

Progress and Prospects

Inbunden, Engelska, 2020

AvJohanna N. Y. Franklin,Christopher P. Porter

2 239 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2020-05-07
Mått157 x 234 x 24 mm
Vikt640 g
FormatInbunden
SpråkEngelska
SerieLecture Notes in Logic
Antal sidor368
FörlagCambridge University Press
ISBN9781108478984

Tillhör följande kategorier

Matematisk statistik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT
Matematikens grunder inom Naturvetenskap och teknik
Databaser inom Data och IT

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.

1. Key developments in algorithmic randomness Johanna N. Y. Franklin and Christopher P. Porter; 2. Algorithmic randomness in ergodic theory Henry Towsner; 3. Algorithmic randomness and constructive/computable measure theory Jason Rute; 4. Algorithmic randomness and layerwise computability Mathieu Hoyrup; 5. Relativization in randomness Johanna N. Y. Franklin; 6. Aspects of Chaitin's Omega George Barmpalias; 7. Biased algorithmic randomness Christopher P. Porter; 8. Higher randomness Benoit Monin; 9. Resource bounded randomness and its applications Donald M. Stull; Index.