Kolmogorov Complexity and Computational Complexity - Rilegato

 
9783540558408: Kolmogorov Complexity and Computational Complexity
Rilegato
ISBN 10: 3540558403 ISBN 13: 9783540558408
Casa editrice: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1992

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Data di pubblicazione
1992
Lingua
Inglese
ISBN 10 
3540558403
ISBN 13 
9783540558408
Rilegatura
Copertina rigida
Numero edizione
1
Numero di pagine
112
Redattore
Watanabe Osamu
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Altre edizioni note dello stesso titolo

9783642777370: Kolmogorov Complexity and Computational Complexity

Edizione in evidenza

ISBN 10:  3642777376 ISBN 13:  9783642777370
Casa editrice: Springer, 2011
Brossura