Kolmogorov Complexity and Algorithmic Randomness
V. A. Uspensky, N. Vereshchagin, A. Shen
Sold by Rarewaves.com UK, London, United Kingdom
AbeBooks Seller since June 11, 2025
New - Soft cover
Condition: New
Quantity: 5 available
Add to basketSold by Rarewaves.com UK, London, United Kingdom
AbeBooks Seller since June 11, 2025
Condition: New
Quantity: 5 available
Add to basketLooking 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.
Seller Inventory # LU-9781470470647
"About this title" may belong to another edition of this title.
Please note that we do not offer Priority shipping to any country.
We currently do not ship to the below countries:
Russia
Belarus
Ukraine
Israel
Please do not attempt to place orders with any of these countries as a ship to address - they will be cancelled.
| Order quantity | 60 to 60 business days | 60 to 60 business days |
|---|---|---|
| First item | US$ 86.02 | US$ 132.34 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.