Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series) - Tapa blanda
Sinopsis
This book contains five survey papers on recent research on Kolmogorov complexity (in particular resource bounded Kolmogorov complexity) and its relation to structural and computational complexity.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Kolmogorov Complexity and Computational Complexity...
Imagen de archivo
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9783642777370
Comprar nuevo
EUR 97,24
Gastos de envío:
EUR 7,75
A Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen de archivo
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020236143
Comprar nuevo
EUR 103,12
Gastos de envío:
EUR 3,44
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642777370_new
Comprar nuevo
EUR 108,33
Gastos de envío:
EUR 13,57
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Kolmogorov Complexity and Computational Complexity
Publicado por
Springer, Springer Vieweg Dez 2011, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 120 pp. Englisch. Nº de ref. del artículo: 9783642777370
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Kolmogorov Complexity and Computational Complexity
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: 5070379
Comprar nuevo
EUR 92,27
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An Eatcs Series)
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. reprint edition. 112 pages. 9.25x6.10x0.02 inches. In Stock. Nº de ref. del artículo: x-3642777376
Comprar nuevo
EUR 149,36
Gastos de envío:
EUR 11,32
De Reino Unido a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Kolmogorov Complexity and Computational Complexity
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Kolmogorov Complexity and Computational Complexity | Osamu Watanabe | Taschenbuch | VII | Englisch | 2011 | Springer | EAN 9783642777370 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 106331912
Comprar nuevo
EUR 95,80
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Kolmogorov Complexity and Computational Complexity
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 120 pp. Englisch. Nº de ref. del artículo: 9783642777370
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Kolmogorov Complexity and Computational Complexity
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783642777370
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 60,98
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles