Algorithmic Randomness - Progress and Prospects (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Lecture Notes in Logic
Release date:	May 2020
Editors:	Johanna N. Y. Franklin • Christopher P. Porter
Dimensions:	234 x 157 x 24mm (L x W x T)
Format:	Hardcover
Pages:	368
ISBN-13:	978-1-108-47898-4
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Books > Computing & IT > Applications of computing > Databases > General
LSN:	1-108-47898-0
Barcode:	9781108478984

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!