Kolmogorov Complexity and Algorithmic Randomness |
|
| Author:
| Shen, A.
Uspensky, V. A.
Vereshchagin, N. |
| Series title: | Mathematical Surveys and Monographs |
| ISBN: | 978-1-4704-3182-2 |
| Publication Date: | Nov 2017 |
| Publisher: | American Mathematical Society
|
| Book Format: | Hardback |
| List Price: | USD $124.00USD $124.00 |
Book Description:
|
Offers a textbook-style exposition of the basic notions of complexity and randomness; and 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.
Offers a textbook-style exposition of the basic notions of complexity and randomness; and 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.