An Introduction to Kolmogorov Complexity and Its Applications

preview-18
  • An Introduction to Kolmogorov Complexity and Its Applications Book Detail

  • Author : Ming Li
  • Release Date : 2013-03-09
  • Publisher : Springer Science & Business Media
  • Genre : Mathematics
  • Pages : 655
  • ISBN 13 : 1475726066
  • File Size : 30,30 MB

An Introduction to Kolmogorov Complexity and Its Applications by Ming Li PDF Summary

Book Description: 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).

Disclaimer: www.yourbookbest.com does not own An Introduction to Kolmogorov Complexity and Its Applications books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity

File Size : 88,88 MB
Total View : 1437 Views
DOWNLOAD

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of