Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and their applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing. In this new edition the authors have added new material on circuit theory, distributed algorithms, data compression, and other topics.

Скачать книгу бесплатно (djvu, 4.55 Mb)

---

Читать «An introduction to Kolmogorov complexity and its applications»