An Introduction to Kolmogorov Complexity and Its Applications

Paperback, 816 pages

Published 2019 by Springer.

ISBN:
978-3-030-11297-4
Copied ISBN!
No rating (0 reviews)

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 …

2 editions

Subjects

  • Mathematics
  • Theoretical Computer Science
  • Algorithmic Complexity Theory
  • Computability Theory
  • Learning Theory
  • Information Theory