Kolmogorov Complexity and Computational Complexity
Seiten
2011
|
1. Softcover reprint of the original 1st ed. 1992
Springer Berlin (Verlag)
978-3-642-77737-0 (ISBN)
Springer Berlin (Verlag)
978-3-642-77737-0 (ISBN)
The mathematical theory of computation has given rise to two important ap proaches to the informal notion of "complexity": Kolmogorov complexity, usu ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu tational complexity, usually a complexity measure for a set of objects, measures the compuational resources necessary to recognize or produce elements of the set. The relation between these two complexity measures has been considered for more than two decades, and may interesting and deep observations have been obtained. In March 1990, the Symposium on Theory and Application of Minimal Length Encoding was held at Stanford University as a part of the AAAI 1990 Spring Symposium Series. Some sessions of the symposium were dedicated to Kolmogorov complexity and its relations to the computational complexity the ory, and excellent expository talks were given there. Feeling that, due to the importance of the material, some way should be found to share these talks with researchers in the computer science community, I asked the speakers of those sessions to write survey papers based on their talks in the symposium. In response, five speakers from the sessions contributed the papers which appear in this book.
Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory.- On Sets with Small Information Content.- Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness.- Resource Bounded Kolmogorov Complexity and Statistical Tests.- Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity.
Erscheint lt. Verlag | 21.12.2011 |
---|---|
Reihe/Serie | Monographs in Theoretical Computer Science. An EATCS Series |
Zusatzinfo | VII, 105 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 194 g |
Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
Informatik ► Theorie / Studium ► Algorithmen | |
Mathematik / Informatik ► Mathematik ► Graphentheorie | |
Schlagworte | Algorithm analysis and problem complexity • Algorithmen • algorithms • combinatorics • Complexity • Complexity theory • Computational Complexity • Entropy • Information • Kolmogorov • Kolmogorov complexity • Kolmogorov-Komplexität • Komplexitätstheorie • randomness • recource bounded Kolmogorov complexity • Structural Complexity • Struktur • strukturelle Komplexität • theory of complexity |
ISBN-10 | 3-642-77737-6 / 3642777376 |
ISBN-13 | 978-3-642-77737-0 / 9783642777370 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Lean UX und Design Thinking: Teambasierte Entwicklung …
Buch | Hardcover (2022)
dpunkt (Verlag)
CHF 48,85
Aus- und Weiterbildung nach iSAQB-Standard zum Certified Professional …
Buch | Hardcover (2023)
dpunkt Verlag
CHF 48,85
Wissensverarbeitung - Neuronale Netze
Buch | Hardcover (2023)
Carl Hanser (Verlag)
CHF 48,95