"The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field." Journal of Symbolic Logic
Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing.
It will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. The book is self-contained in that it contains the basic requirements from mathematics and computer science.
Included are also numerous problem sets, comments, source references, and hints to solutions of problems. 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.
| ISBN: | 9780387339986 |
| Publication date: | 21st November 2008 |
| Author: | Ming Li, P M B Vitányi |
| Publisher: | Springer an imprint of Springer New York |
| Format: | Hardback |
| Pagination: | 790 pages |
| Series: | Texts in Computer Science |
| Genres: |
Applied mathematics Pattern recognition Numerical analysis Probability and statistics Information theory Coding theory and cryptology Mathematical theory of computation Computer science |
The book presents a thorough treatment of the subject with a wide range of illustrative applications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing.
An Introduction to Kolmogorov Complexity and Its Applications features in the following genres: Applied mathematics, Pattern recognition, Numerical analysis, Probability and statistics, Information theory, Coding theory and cryptology, Mathematical theory of computation, Computer science
Hardback. Not Available.
An Introduction to Kolmogorov Complexity and Its Applications was written by Ming Li, P M B Vitányi and published by Springer an imprint of Springer New York
An Introduction to Kolmogorov Complexity and Its Applications has 790 pages
Yes it is part of Texts in Computer Science series