Contacto
Cómo comprar
Entrega
Guía de compras
Bounded Queries in Recursion Theory
Inglés
290 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
58.09
€
/
Tapa blanda
47.29
€
/
Tapa blanda
103.29
€
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
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 blanda
35.79
€
/
Tapa blanda
40.69
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?