An Introduction to Kolmogorov Complexity and Its Applications

Buch | Hardcover
792 Seiten
2008 | 3rd ed. 2008
Springer-Verlag New York Inc.
978-0-387-33998-6 (ISBN)

Lese- und Medienproben

An Introduction to Kolmogorov Complexity and Its Applications - Ming Li, Paul M.B. Vitányi
90,94 inkl. MwSt
  • Titel erscheint in neuer Auflage
  • Artikel merken
“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.

Preliminaries.- Algorithmic Complexity.- Algorithmic Prefix Complexity.- Algorithmic Probability.- Inductive Reasoning.- The Incompressibility Method.- Resource-Bounded Complexity.- Physics, Information, and Computation.

Reihe/Serie Texts in Computer Science
Zusatzinfo 11 Tables, black and white; 21 Illustrations, black and white; XXIV, 792 p. 21 illus.
Verlagsort New York, NY
Sprache englisch
Maße 178 x 235 mm
Gewicht 1575 g
Themenwelt Mathematik / Informatik Informatik
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Komplexitätstheorie
ISBN-10 0-387-33998-1 / 0387339981
ISBN-13 978-0-387-33998-6 / 9780387339986
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren

von Michael Karbach

Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
69,95