author : Ming Li

New key features and topics in the 3rd edition:
• New results on randomness
• Kolmogorov’s structure function, model selection, and MDL
• Incompressibility method: counting unlabeled graphs; Shellsort, communication complexity
• Derandomization
• Kolmogorov complexity versus Shannon information, rate distortion, lossy compression, denoising
• Theoretical results on information distance
• The similarity metric with applications to genomics, phylogeny, clustering, classification, semantic meaning, question-answer systems
• Quantum Kolmogorov complexity

Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in all fields of science. It is self-contained: it contains the basic requirements from mathematics, probability theory, statistics, information theory, and computer science. Included are history, theory, new developments, a wide range of applications, numerous (new) problem sets, comments, source references, and hints to solutions of problems. This is the only comprehensive treatment of the central ideas of Kolmogorov complexity and their applications.