An Introduction to Kolmogorov Complexity and Its Applications

An Introduction to Kolmogorov Complexity and Its Applications
Author :
Publisher : Springer Science & Business Media
Total Pages : 655
Release :
ISBN-10 : 9781475726060
ISBN-13 : 1475726066
Rating : 4/5 (066 Downloads)

Book Synopsis An Introduction to Kolmogorov Complexity and Its Applications by : Ming Li

Download or read book An Introduction to Kolmogorov Complexity and Its Applications written by Ming Li and published by Springer Science & Business Media. This book was released on 2013-03-09 with total page 655 pages. Available in PDF, EPUB and Kindle. Book excerpt: Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropriate historical and conceptual context we trace the main roots of Kolmogorov complexity. This way the stage is set for Chapters 2 and 3, where we introduce the notion of optimal effective descriptions of objects. The length of such a description (or the number of bits of information in it) is its Kolmogorov complexity. We treat all aspects of the elementary mathematical theory of Kolmogorov complexity. This body of knowledge may be called algo rithmic complexity theory. The theory of Martin-Lof tests for random ness of finite objects and infinite sequences is inextricably intertwined with the theory of Kolmogorov complexity and is completely treated. We 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. We also investigate the recursion theoretic properties of Kolmogorov complexity (relations with Godel's incompleteness result), and the Kolmogorov complexity version of infor mation theory, which we may call "algorithmic information theory" or "absolute information theory. " The treatment of algorithmic probability theory in Chapter 4 presup poses Sections 1. 6, 1. 11. 2, and Chapter 3 (at least Sections 3. 1 through 3. 4).


An Introduction to Kolmogorov Complexity and Its Applications Related Books

An Introduction to Kolmogorov Complexity and Its Applications
Language: en
Pages: 655
Authors: Ming Li
Categories: Mathematics
Type: BOOK - Published: 2013-03-09 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropria
An Introduction to Kolmogorov Complexity and Its Applications
Language: en
Pages: 670
Authors: Ming Li
Categories: Mathematics
Type: BOOK - Published: 1997-02-27 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropria
Kolmogorov Complexity and Algorithmic Randomness
Language: en
Pages: 534
Authors: A. Shen
Categories: Computers
Type: BOOK - Published: 2017-11-02 - Publisher: American Mathematical Soc.

DOWNLOAD EBOOK

Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer i
Algorithmic Randomness and Complexity
Language: en
Pages: 883
Authors: Rodney G. Downey
Categories: Computers
Type: BOOK - Published: 2010-10-29 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of
Kolmogorov Complexity and Computational Complexity
Language: en
Pages: 111
Authors: Osamu Watanabe
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

The mathematical theory of computation has given rise to two important ap proaches to the informal notion of "complexity": Kolmogorov complexity, usu ally a com