Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science : An Eatcs Series) - Hardcover

 
9783540558408: Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science : An Eatcs Series)
Hardcover
ISBN 10: 3540558403 ISBN 13: 9783540558408
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1992

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Erscheinungsdatum
1992
Sprache
Englisch
ISBN 10 
3540558403
ISBN 13 
9783540558408
Einband
Tapa dura
Anzahl der Seiten
112
Herausgeber
Watanabe Osamu
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783642777370: Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)

Vorgestellte Ausgabe

ISBN 10:  3642777376 ISBN 13:  9783642777370
Verlag: Springer, 2011
Softcover