Kolmogorov Complexity and Algorithmic Randomness

✍ Scribed by A. Shen, V. A. Uspensky, N. Vereshchagin

Publisher: Amer Mathematical Society
Year: 2017
Tongue: English
Leaves: 534
Series: Mathematical Surveys and Monographs
Category: Library

No coin nor oath required. For personal study only.

✦ 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.

📜 SIMILAR VOLUMES

Algorithmic Randomness and Complexity

📁 Algorithmic Randomness and Complexity

✍ Rodney G. Downey, Denis R. Hirschfeldt 📂 Library 📅 2010 🏛 Springer 🌐 English

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object su

Algorithmic Randomness and Complexity

📁 Algorithmic Randomness and Complexity

✍ Rodney G. Downey, Denis R. Hirschfeldt (auth.) 📂 Library 📅 2010 🏛 Springer 🌐 English

Algorithmic Randomness and Complexity

📁 Algorithmic Randomness and Complexity

✍ Rod G. Downey, Denis Roman Hirschfeldt 📂 Library 📅 2010 🏛 Springer 🌐 English

Intuitively, a sequence such as 101010101010101010... does not seem random, whereas 101101011101010100..., obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object s

Algorithmic Randomness and Complexity

📁 Algorithmic Randomness and Complexity

✍ Rodney G. Downey, Denis R. Hirschfeldt 📂 Library 📅 2010 🏛 Springer 🌐 English

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields. Intuitively, a sequence such as 1

Kolmogorov Complexity and Computational

📁 Kolmogorov Complexity and Computational Complexity

✍ Osamu Watanabe 📂 Library 📅 1992 🏛 Springer 🌐 English

The mathematical theory of computation has given rise to two important ap proaches to the informal notion of "complexity": Kolmogorov complexity, usu ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the obj

Kolmogorov Complexity and Computational

📁 Kolmogorov Complexity and Computational Complexity

✍ Osamu Watanabe 📂 Library 📅 1992 🏛 Springer 🌐 English

There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures