Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Kolmogorov Complexity and Computational Complexity -

Kolmogorov Complexity and Computational Complexity

Osamu Watanabe (Herausgeber)

Buch | Hardcover
VIII, 108 Seiten
1992
Springer Berlin (Verlag)
978-3-540-55840-8 (ISBN)
CHF 44,85 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures the computational resources necessary to recognize (or produce) an object. The relation between these two complexity measures has been studied since the 1960s. More recently, the more generalized notion of resource bounded Kolmogorov complexity and its relation to computational complexity have received much attention. Now many interesting and deep observations on this topic have been established. This book consists of four survey papers concerning these recent studies on resource bounded Kolmogorov complexity and computational complexity. It also contains one paper surveying several types of Kolmogorov complexity measures. The papers are based on invited talks given at the AAAI Spring Symposium on Minimal-Length Encoding in 1990. The book is the only collection of survey papers on this subject and provides fundamental information for researchers in the field.
Reihe/Serie Texts in Theoretical Computer Science. An EATCS Series
Sprache deutsch
Gewicht 298 g
Einbandart gebunden
Themenwelt Mathematik / Informatik Informatik
Schlagworte HC/Informatik, EDV/Informatik • Komplexität • Komplexitätstheorie
ISBN-10 3-540-55840-3 / 3540558403
ISBN-13 978-3-540-55840-8 / 9783540558408
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
leichter Einstieg für Senioren

von Philip Kiefer

Buch | Softcover (2024)
Markt + Technik Verlag
CHF 13,90