Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs) - Softcover

A. Shen (author)|V. A. Uspensky (author)|N. Vereshchagin (author)

 
9781470470647: Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)
Softcover
ISBN 10: 1470470640 ISBN 13: 9781470470647
Publisher: American Mathematical Society, 2017

Synopsis

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.

"synopsis" may belong to another edition of this title.

About the Author

A. Shen, LIRMM CRNS, Université de Montpellier, France.

V. A. Uspensky, Lomonosov Moscow State University, Russia.

N. Vereshchagin, Lomonosov Moscow State University, Russia.

"About this title" may belong to another edition of this title.

Publisher
American Mathematical Society
Publication date
2017
Language
English
ISBN 10 
1470470640
ISBN 13 
9781470470647
Binding
Paperback
Number of pages
511

Other Popular Editions of the Same Title

9781470431822: Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Featured Edition

ISBN 10:  1470431823 ISBN 13:  9781470431822
Publisher: American Mathematical Society, 2017
Hardcover