Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)

Levine, William; Martin, Georgia

ISBN 10: 1461268486 ISBN 13: 9781461268482

Editorial: Birkhäuser, 2013

Idioma: Ingl�s

Condici�n: Nuevo Encuadernaci�n de tapa blanda

Guardar para m�s tarde

Vendido por Best Price, Torrance, CA, Estados Unidos de America

Vendedor de AbeBooks desde 30 de agosto de 2024

Calificaci�n del vendedor: 5 de 5 estrellas

Ver los art�culos de este vendedor

Ver todos los ejemplares de este libro

Nuevos - Encuadernaci�n de tapa blanda

Condici�n: Nuevo

Precio: EUR 96,23 Convertir moneda

EUR 6,81 gastos de env�o en Estados Unidos de America Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Guardar para m�s tarde

Descripci�n

SUPER FAST SHIPPING.

N� de ref. del art�culo 9781461268482

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo

Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)

Editor

Birkh�user

Fecha de publicaci�n

2013

Idioma

Ingl�s

ISBN 10

1461268486

ISBN 13

9781461268482

Encuadernaci�n

Encuadernaci�n de tapa blanda

Estado

New

Cat�logos de vendedores

Acerca de

Sinopsis

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.

Cr�ticas

"Ideal for an advanced undergraduate or beginning graduate student who has some exposure to basic computability theory and wants to see what one can do with it. The questions asked are interesting and can be easily understood and the proofs can be followed without a large amount of training in computability theory."

--Sigact News

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

50+ Million Books in stock & ready to ship! Excellent Prices, Service & Selection.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Condiciones de venta y env�o

Condiciones de venta

When you see an item on our listing, it means we have it available in one of our warehouses right here right now, ready for same day or next day processing of your order. Over 50+ Million books in stock & ready to ship same day. Customer Service is a top priority for us, we want every customer to be 100% satisfied. We offer the world's largest selection of books, music and video. Maintaining an accurate inventory of more than 50+ Million items, we are able to ship your order the same day it is r...

M�s informaci�n

Derecho a cancelaci�n

Condiciones de env�o

SUPER FAST SHIPPING!

Tarifas de env�o en Estados Unidos de America

Tarifas de env�o en Estados Unidos de America
Cantidad del pedido	De 1 a 3 d�as h�biles	De 1 a 3 d�as h�biles
Primer art�culo	EUR 6.81	EUR 17.06

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.