Surveys on recent developments in the theory of algorithmic randomness and its interactions with other areas of mathematics.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Artikel-Nr. 41186322
Anzahl: Mehr als 20 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. 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 entr. Artikel-Nr. 371096688
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 300 pages. 9.00x6.00x1.00 inches. In Stock. Artikel-Nr. x-1108478980
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware - 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. Artikel-Nr. 9781108478984
Anzahl: 2 verfügbar