An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
| Author | : | |
| Rating | : | 4.89 (831 Votes) |
| Asin | : | 0387339981 |
| Format Type | : | paperback |
| Number of Pages | : | 792 Pages |
| Publish Date | : | 2017-05-17 |
| Language | : | English |
DESCRIPTION:
Shen, Journal of Symbolic Logic"It is clear that this book will become 'the' Kolmogorov complexity book."Marius Zimand, Mathematical ReviewsFrom the reviews of the third edition: "Kolmogorov complexity, algorithmic information theory, minimum description length, and other information-based disciplines have experienced a phenomenal explosion in the last decade. From the reviews of the second edition:"We are indeed in the information age and the scientific exploration of information and the laws that govern its behavior has taken center stage in the dramatic development of sciences. The authors have added an extra 204 pages, distributed throughout the book … . Uspensky and Alexander K. Kolmogorov complexity is a central concept and a powerful tool in the understanding of the quantitative nature of information and its processing and tra
Biggest return for the biggest investment This was the second-hardest book I ever read. Honestly, it took me years and years to get through it. I even had to buy a 2nd copy, because I kept getting frustrated and throwing the first copy across the room until it was destroyed. So yes, this book requires a substantial effort to read.But the payback!! I've gotten more return on investment from this book than from any other book I've ever read. If you dilligently read and master this book, you will be able to analyze and solve problems your collegues just can't.The basic idea behind Kolmogorov complexity is straighforward: a good measure of the complexity of an object is the lengt. Excellent if you have the math Zentao to understand it. This book is intended for serious students of computer science or those who have some similar training - it is definitely set up as a textbook. However, that being said, if you have the background the authors' delivery is fist-class and very clear.The reviews below give more than enough information so I won't belabour the Kolmogorov complexity here. Suffice it to say you won't find the subject detailed more fully in any other reference work in existence today.However, this book does need to be revised and updated. There has been a lot of development in the field and the sections overviewing Solomonoff's work, in part. Dr. Lee D. Carlson said The only one of its kind.. The theory of Kolmogorov complexity attempts to define randomness in terms of the complexity of the program used to compute it. The authors give an excellent overview of this theory, and even discuss some of its philosophical ramifications, but they are always careful to distinguish between mathematical rigor and philosophical speculation. And, interestingly, the authors choose to discuss information theory in physics and the somewhat radical idea of reversible computation. The theory of Kolmogorov complexity is slowly making its way into applications, these being coding theory and computational intelligence, and network performance o
It will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. New topics in this edition include Omega numbers, Kolmogorov–Loveland randomness, universal learning, communication complexity, Kolmogorov's random graphs, time-limited universal distribution, Shannon information and others.. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, info