Description
An Introduction to Kolmogorov Complexity and Its Applications (4th Ed., 4th ed. 2019)
Texts in Computer Science Series
Authors: Li Ming, Vitányi Paul
Language: EnglishSubjects for An Introduction to Kolmogorov Complexity and Its...:
Approximative price 94.94 €
In Print (Delivery period: 15 days).
Add to cart the book of Li Ming, Vitányi Paul834 p. · 17.8x25.4 cm · Hardback
Description
/li>Contents
/li>Biography
/li>Comment
/li>
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.
Preliminaries
Algorithmic Complexity
Algorithmic Prefix Complexity
Algorithmic Probability
Inductive Reasoning
The Incompressibility Method
Resource-Bounded Complexity
Physics, Information, and Computation
Develops Kolmogorov theory in detail, and outlines a wide range of illustrative applications
Examines major results from prominent researchers in the field
Details the practical application of KC in the similarity metric and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering
Includes new and updated material on the Miller-Yu theorem, the Gács-Kucera theorem, the Day-Gács theorem, the Lovász local lemma, and the Slepian-Wolf theorem
Discusses short lists computable from an input string containing the incomputable Kolmogorov complexity of the input
Covers topics of increasing randomness, sorting, multiset normalized information distance and normalized web distance, and conditional universal distribution
Includes supplementary material: sn.pub/extras