Contacto
Cómo comprar
Entrega
Guía de compras
Kolmogorov Complexity and Computational Complexity
Inglés
276 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
37.49
€
/
Tapa blanda
17.89
€
/
Tapa blanda
16.09
€
/
Tapa blanda
19.89
€
/
Tapa blanda
10.69
€
/
Tapa blanda
63.39
€
/
Tapa blanda
28.69
€
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.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa dura
41.59
€
/
Tapa blanda
11.59
€
/
Tapa blanda
37.69
€
/
Adobe ePub DRM
49.79
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?