An Introduction to Kolmogorov Complexity and Its Applications (Monographs in Computer Science)
Description:
With this book, the authors are trying to present in a unified treatment an introduction to the central ideas and their applications of the Kolmogorov Complexity, the theory dealing with the quantity of information in individual objects. This book is appropriate for either a one- or two-semester introductory course in departments of computer science, mathematics, physics, probability theory and statistics, artificial intelligence, and philosophy. Although the mathematical theory of Kolmogorov complexity contains sophisticated mathematics, the amount of math one needs to know to apply the notions in widely divergent areas, is very little. The authors' purpose is to develop the theory in detail and outline a wide range of illustrative applications. This book is an attempt to grasp the mass of fragmented knowledge of this fascinating theory. Chapter 1 is a compilation of material on the diverse notations and disciplines we draw upon in order to make the book self-contained. The mathematical theory of Kolmogorov complexity is treated in chapters 2-4; the applications are treated in chapters 4-8.
Best prices to buy, sell, or rent ISBN 9780387940533
Frequently Asked Questions about An Introduction to Kolmogorov Complexity and Its Applications (Monographs in Computer Science)
The price for the book starts from $23.96 on Amazon and is available from 7 sellers at the moment.
If you’re interested in selling back the An Introduction to Kolmogorov Complexity and Its Applications (Monographs 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 (Monographs in Computer Science) book, the best buyback offer comes from and is $ for the book in good condition.
Not enough insights yet.
Not enough insights yet.