عنوان

An introduction to Kolmogorov complexity and its applications

(Number (ISBN

9783030112981

Number

E328

.Language of Text, Soundtrack etc

انگلیسی

Title Proper

An introduction to Kolmogorov complexity and its applications

First Statement of Responsibility

by Ming Li, Paul Vitanyi

Edition Statement

4th ed.

Place of Publication, Distribution, etc.

Cham, Switzerland

Name of Publisher, Distributor, etc.

Springer

Date of Publication, Distribution, etc.

2019

Specific Material Designation and Extent of Item

xxiii, 834 p.

Series Title

(Texts in computer science)

Text of Note

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

Text of Note

Includes bibliographical references and index

Text of Note

"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

Kolmogorov complexity

Class number

Book number

Li, Ming, 1955 July 16-

Vitanyi, P. M. B.

Country

Iran

Agency

University of Tehran. Library of College of Science

Date and Hour of Consultation and Access

UT_SCI_BL_DB_1002480_0001.pdf

e

BL

278840

a

Y