Study Week: Englischsprachige Lehrbücher für je nur 14,99€ – eBooks & Softcover im Angebot! Jetzt ansehen >>

Texts in Computer Science

An Introduction to Kolmogorov Complexity and Its Applications

Autoren: Li, Ming, Vitanyi, Paul

Vorschau

Dieses Buch kaufen

eBook 67,40 €
Preis für Deutschland (Brutto)
  • ISBN 978-1-4757-2606-0
  • Versehen mit digitalem Wasserzeichen, DRM-frei
  • Erhältliche Formate: PDF
  • eBooks sind auf allen Endgeräten nutzbar
  • Sofortiger eBook Download nach Kauf
Über dieses Lehrbuch

Briefly, we review the basic elements of computability theory and prob­ ability theory that are required. Finally, in order to place the subject in the appropriate historical and conceptual context we trace the main roots of Kolmogorov complexity. This way the stage is set for Chapters 2 and 3, where we introduce the notion of optimal effective descriptions of objects. The length of such a description (or the number of bits of information in it) is its Kolmogorov complexity. We treat all aspects of the elementary mathematical theory of Kolmogorov complexity. This body of knowledge may be called algo­ rithmic complexity theory. The theory of Martin-Lof tests for random­ ness of finite objects and infinite sequences is inextricably intertwined with the theory of Kolmogorov complexity and is completely treated. We also investigate the statistical properties of finite strings with high Kolmogorov complexity. Both of these topics are eminently useful in the applications part of the book. We also investigate the recursion­ theoretic properties of Kolmogorov complexity (relations with Godel's incompleteness result), and the Kolmogorov complexity version of infor­ mation theory, which we may call "algorithmic information theory" or "absolute information theory. " The treatment of algorithmic probability theory in Chapter 4 presup­ poses Sections 1. 6, 1. 11. 2, and Chapter 3 (at least Sections 3. 1 through 3. 4).

Inhaltsverzeichnis (8 Kapitel)

Inhaltsverzeichnis (8 Kapitel)

Dieses Buch kaufen

eBook 67,40 €
Preis für Deutschland (Brutto)
  • ISBN 978-1-4757-2606-0
  • Versehen mit digitalem Wasserzeichen, DRM-frei
  • Erhältliche Formate: PDF
  • eBooks sind auf allen Endgeräten nutzbar
  • Sofortiger eBook Download nach Kauf
Loading...

Wir empfehlen

Loading...

Bibliografische Information

Bibliographic Information
Buchtitel
An Introduction to Kolmogorov Complexity and Its Applications
Autoren
Titel der Buchreihe
Texts in Computer Science
Copyright
1997
Verlag
Springer-Verlag New York
Copyright Inhaber
Springer Science+Business Media New York
eBook ISBN
978-1-4757-2606-0
DOI
10.1007/978-1-4757-2606-0
Buchreihen ISSN
1868-0941
Auflage
2
Seitenzahl
XX, 637
Anzahl der Bilder
8 schwarz-weiß Abbildungen
Zusätzliche Informationen
Originally published in the series: Texts, Monographs Computer Science
Themen