This must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features.
This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kucera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution.
ISBN: | 9783030112974 |
Publication date: | 26th June 2019 |
Author: | Ming Li, Paul Vitányi |
Publisher: | Springer an imprint of Springer International Publishing |
Format: | Hardback |
Pagination: | 834 pages |
Series: | Texts in Computer Science |
Genres: |
Applied mathematics Pattern recognition Algorithms and data structures Mathematical theory of computation Information theory Coding theory and cryptology Probability and statistics |