DeepRead
Cover of An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications

Ming Li, Paul Vitanyi · 1993

Mathematics and physics › Feynman and physics

#4,164 most recommended

About the book

The book covers Kolmogorov complexity, the length of the shortest program that produces a given object, and the theory built around it. It is written to be self-contained, first developing the mathematics and computability background it needs, then presenting the theory and its uses in computer science, statistics, physics, and philosophy. Its central claim is that the compressibility of an object measures its regularity in a way that does not depend on any particular machine, up to an additive constant. From this it develops notions of randomness, prediction through the universal distribution, and the minimum description length principle for inductive inference. It also presents the incompressibility method as a way to prove lower bounds and average-case results in algorithms and combinatorics, while noting that Kolmogorov complexity itself cannot be computed exactly.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420092015202020242016 peak · 4
This bookAverage book in Feynman and physics

In the commenters’ own words

What Open Library readers say 5.00 from 1 rating

  1. 51
  2. 40
  3. 30
  4. 20
  5. 10
  • 5 want to read
  • 0 reading
  • 1 have read

Only 1 rating: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1993
ISBN
9783030112974
Editions known
6 at Open Library
Open Library
OL1332298W

Kolmogorov complexity

Explore in the mosaic

Read next: its neighbours on the mosaic