The descriptive complexity of strings
The descriptive complexity of strings
This chapter develops the theory of plain Kolmogorov complexity, and then of prefix-free Kolmogorov complexity. A main technical tool for later chapters is the Machine Existence (or Kraft–Chaitin) Theorem. The chapter uses some probability theory to obtain statistical properties of incompressible strings.
Keywords: Kolmogorov complexity, prefix freeness, Machine Existence Theorem, Kraft–Chaitin, incompressibility
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .