Artículos relacionados a Bounded Queries in Recursion Theory: 16 (Progress in...
Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic) - Tapa blanda
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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
Reseña del editor
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 este título" puede pertenecer a otra edición de este libro.
- EditorialBirkhäuser
- Año de publicación2013
- ISBN 10 1461268486
- ISBN 13 9781461268482
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas372
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 74,85
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Bounded Queries in Recursion Theory: 16 (Progress in...
Imagen del vendedor
Bounded Queries in Recursion Theory
Publicado por
Birkhäuser Boston Jul 2013, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
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 -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. 372 pp. Englisch. Nº de ref. del artículo: 9781461268482
Cantidad disponible: 2 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9781461268482
Cantidad disponible: 10 disponibles
Imagen del vendedor
Bounded Queries in Recursion Theory
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 4189485
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
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: ria9781461268482_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Bounded Queries in Recursion Theory
Publicado por
Birkhäuser Boston, Birkhäuser Boston, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
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 - 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. Nº de ref. del artículo: 9781461268482
Cantidad disponible: 1 disponibles
Imagen del vendedor
Bounded Queries in Recursion Theory
Publicado por
Birkhäuser Boston, Birkhäuser Boston Jul 2013, 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
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 -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 372 pp. Englisch. Nº de ref. del artículo: 9781461268482
Cantidad disponible: 1 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory
Publicado por
Springer-Verlag New York Inc., 2013
ISBN 10: 1461268486
ISBN 13: 9781461268482
Nuevo
Paperback / softback
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 552. Nº de ref. del artículo: C9781461268482
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 374. Nº de ref. del artículo: 2697522264
Cantidad disponible: 4 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 374 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 94875015
Cantidad disponible: 4 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
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: ABLIING23Mar2716030028322
Cantidad disponible: Más de 20 disponibles