Erschienen: 21.11.2008 Abbildung von Li / Vitányi | An Introduction to Kolmogorov Complexity and Its Applications | 2008

Li / Vitányi

An Introduction to Kolmogorov Complexity and Its Applications

lieferbar ca. 10 Tage als Sonderdruck ohne Rückgaberecht

ca. 90,94 €

inkl. Mwst.

2008. Buch. xxiv, 792 S. 21 s/w-Abbildungen, 11 s/w-Tabelle, Bibliographien. Hardcover

Springer. ISBN 978-0-387-33998-6

Format (B x L): 17,8 x 23,5 cm

Gewicht: 1575 g

In englischer Sprache

Das Werk ist Teil der Reihe: Texts in Computer Science


“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.


  • Dieses Set enthält folgende Produkte:
      Auch in folgendem Set erhältlich:
      • nach oben

        Ihre Daten werden geladen ...