Review of An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 Authors: Ming I,i and Paul Vitanyi Publisher~ Springer (Graduate Text Series) Reviewer: William Casarch Overview The string 111111111111 looks "less random" then the string 100110001001. Kolmogorov complexity makes this intuitive notion of randomness rigorous. Once this is done, new questions arise and some old questions can be answered. This book spends half of its time making these notions rigorous, and the other half applying them. More precisely: 1. Chapters 1-4 carefully establish the rigorous definitions needed to s t u d y randomness. If this were the only goal it would not need four chapters; however, the authors also explore many issues that lead to the definitions and that are consequences of the definitions. 2. Chapters 5-7 apply Kolmogorov complexity to computer science; chapter 8 applies it to Physics. Most of the applications only use a small part of what is in chapter 1-4. This is g o o d - - if a :reader is only interested in applications they can read these chapters having just learned a few things from chapters 1-4. S u m m a r y of C o n
/lp/association-for-computing-machinery/book-review-an-introduction-to-kolmogorov-complexity-and-its-9su4qwTyNt