An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

(10)
An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) image
ISBN-10:

3030112977

ISBN-13:

9783030112974

Edition: 4th ed. 2019
Released: Jun 26, 2019
Publisher: Springer
Format: Hardcover, 857 pages

Description:

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 the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface.As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.

Best prices to buy, sell, or rent ISBN 9783030112974




Related Books

Frequently Asked Questions about An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

You can buy the An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) book at one of 20+ online bookstores with BookScouter, the website that helps find the best deal across the web. Currently, the best offer comes from and is $ for the .

The price for the book starts from $86.22 on Amazon and is available from 22 sellers at the moment.

At BookScouter, the prices for the book start at $79.77. Feel free to explore the offers for the book in used or new condition from various booksellers, aggregated on our website.

If you’re interested in selling back the An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.

As for the An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) book, the best buyback offer comes from and is $ for the book in good condition.

The An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) book is in very low demand now as the rank for the book is 1,706,595 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.

The highest price to sell back the An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) book within the last three months was on December 23 and it was $39.11.