‘The book is outstanding and admirable in many respects. is necessary readingfor 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 theirapplications of Kolmogorov complexity. The book presents a thorough treatmentof 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, thecomplexity 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. Develops Kolmogorov theory in detail and outlines the wide range of illustrative applications Presents recent, major results in the field; topics include, Omega numbers, Kolmogorov-Loveland randomness, universal learning, communication complexity, Kolmogorov's random graphs, time-limited universal distribution, Shannon information Introduces results from prominent researchers in the field INDICE: Preliminaries.- Algorithmic Complexity.- Algorithmic Prefix Complexity.- Algorithmic Probability.- Inductive Reasoning.- The Incompressibility Method.- Resource-Bounded Complexity.- Physics, Information, and Computation.- Shannon Information and Kolmogorov Complexity.- Information Distance.
- ISBN: 978-0-387-33998-6
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 800
- Fecha Publicación: 01/08/2008
- Nº Volúmenes: 1
- Idioma: Inglés