An Introduction to Kolmogorov complexity and Its applications / by Ming Li, Paul Vitányi.
2019
QA267.7
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
An Introduction to Kolmogorov complexity and Its applications / by Ming Li, Paul Vitányi.
Edition
Fourth edition
ISBN
9783030112981 (electronic book)
3030112985 (electronic book)
9783030112974
3030112985 (electronic book)
9783030112974
Published
Cham : Springer, [2019]
Copyright
©2019
Language
English
Description
1 online resource (xxiii, 834 pages): illustrations
Other Standard Identifiers
10.1007/978-3-030-11
Call Number
QA267.7
Dewey Decimal Classification
511.3
Summary
"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."--Publisher's website.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Added Author
Vitányi, P. M. B., author.
Series
Texts in computer science.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
1. Preliminaries
2. Algorithmic Complexity
3. Algorithmic Prefix Complexity
4. Algorithmic Probability
5. Inductive Reasoning
6. The Incompressibility Method
7. Resource-Bounded Complexity
8. Physics, Information, and Computation.
2. Algorithmic Complexity
3. Algorithmic Prefix Complexity
4. Algorithmic Probability
5. Inductive Reasoning
6. The Incompressibility Method
7. Resource-Bounded Complexity
8. Physics, Information, and Computation.