Für diesen Artikel ist leider kein Bild verfügbar.

Algorithmic Randomness

Progress and Prospects
Buch | Hardcover
368 Seiten
2020
Cambridge University Press (Verlag)
978-1-108-47898-4 (ISBN)
155,85 inkl. MwSt
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.

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.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Logic
Zusatzinfo Worked examples or Exercises; 3 Tables, black and white; 1 Halftones, black and white; 4 Line drawings, black and white
Verlagsort Cambridge
Sprache englisch
Maße 157 x 234 mm
Gewicht 640 g
Themenwelt Mathematik / Informatik Informatik Datenbanken
Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 1-108-47898-0 / 1108478980
ISBN-13 978-1-108-47898-4 / 9781108478984
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99