Kolmogorov Complexity and Algorithmic Randomness (Paperback)

Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory. The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the "Kolmogorov seminar" in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues. This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	Mathematical Surveys and Monographs
Release date:	2017
Authors:	A. Shen • V.A Uspensky • N. Vereshchagin
Format:	Paperback
Pages:	511
ISBN-13:	978-1-4704-7064-7
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	1-4704-7064-0
Barcode:	9781470470647

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!