An Introduction to Kolmogorov Complexity and Its Applications
- ISBN-10
- 3030112977
- ISBN-13
- 9783030112974
- Series
- An Introduction to Kolmogorov Complexity and Its Applications
- Category
- Mathematics
- Pages
- 834
- Language
- English
- Published
- 2019-06-26
- Publisher
- Springer
- Authors
- Ming Li, Paul Vitanyi
Description
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-Kučera 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. Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface. As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.
Get the book
Other editions
-
- 2008-11-21
- 790 pages
- Paperback
- Springer
-
- 2013-04-18
- 550 pages
- Ebook
- Springer Science & Business Media
-
- 2013-03-09
- 637 pages
- Ebook
- Springer Science & Business Media
-
- 2009-03-18
- 792 pages
- Ebook
- Springer Science & Business Media
Similar books
-
An Introduction to Kolmogorov Complexity and Its Applications
By Ming Li, Paul VitanyiWe also investigate the statistical properties of finite strings with high Kolmogorov complexity. Both of these topics are eminently useful in the applications part of the book.
-
Kolmogorov Complexity and Algorithmic Randomness
By A. Shen, V. A. Uspensky, N. VereshchaginThis book contains numerous exercises (embedded in the text) that will help readers to grasp the material.
-
Algorithmic Randomness and Complexity
By Denis R. Hirschfeldt, Rodney G. DowneyTheorem 2.18.5 (Yates [410], Cooper [76]). Every nonzero c.e. degree bounds a minimal degree. In particular, there are minimal degrees below 0 (which was first shown by Sacks [342]), and hence hyperimmune minimal degrees.
-
Kolmogorov Complexity and Computational Complexity
By Osamu WatanabeIn response, five speakers from the sessions contributed the papers which appear in this book.
-
An Introduction to Kolmogorov Complexity and Its Applications
By Bernd Reusch“The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field.” Journal of Symbolic...
-
Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability
By Marcus HutterDecision Theory = Probability + Utility Theory + + Universal Induction = Ockham + Bayes + Turing = = A Unified View of Artificial Intelligence This book presents sequential decision theory from a novel algorithmic information theory ...
-
Information Theory and Statistical Learning
By Matthias Dehmer, Frank Emmert-StreibThis interdisciplinary text offers theoretical and practical results of information theoretic methods used in statistical learning.
-
Computational Complexity: A Modern Approach
By Sanjeev Arora, Boaz BarakNew and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
-
The Minimum Description Length Principle
By Peter D. GrünwaldThis introduction to the MDL Principle provides a reference accessible to graduate students and researchers in statistics, pattern classification, machine learning, and data mining, to philosophers interested in the foundations of ...
-
Research Anthology on Recent Trends, Tools, and Implications of Computer Programming
By Management Association, Information ResourcesManagement Association, Information Resources ... Towards a dynamic ontology based software project management antipattern intelligent system. In 19th IEEE International ... Software Engineering: Pearson New (International Edition).