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 dura
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.
EUR 14,26
EUR 10,02 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 50,30
EUR 10,38 gastos de envío desde Reino Unido 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 de archivo
Bounded Queries in Recursion Theory
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.55. Nº de ref. del artículo: G0817639667I3N00
Cantidad disponible: 1 disponibles
Imagen del vendedor
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Publicado por
Birkhäuser, 1998
ISBN 10: 0817639667
ISBN 13: 9780817639662
Antiguo o usado
Tapa dura
Librería: Orca Knowledge Systems, Inc., Novato, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: Good. First Edition. No DJ. Ex University of California, Berkeley library book with usual library markings. Binding is tight, text clean. From the back cover: One of the major concerns of theoretical computer science is the classification 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. Nº de ref. del artículo: mon0000018319
Cantidad disponible: 1 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Nº de ref. del artículo: 7563089
Cantidad disponible: 1 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. 376. Nº de ref. del artículo: 26317582
Cantidad disponible: 1 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 376. Nº de ref. del artículo: 18317572
Cantidad disponible: 1 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic)
Publicado por
Birkhäuser, 1998
ISBN 10: 0817639667
ISBN 13: 9780817639662
Antiguo o usado
Tapa dura
Librería: Midtown Scholar Bookstore, Harrisburg, PA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Very Good. no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized. Nº de ref. del artículo: mon0000117696
Cantidad disponible: 2 disponibles
Imagen de archivo
Bounded Queries In Computability Theory (progress In Computer Science And Applied Logic (pcs))
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-83245
Cantidad disponible: 1 disponibles
Imagen de archivo
Bounded Queries In Computability Theory (progress In Computer Science And Applied Logic (pcs))
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-129946
Cantidad disponible: 1 disponibles
Imagen del vendedor
Bounded Queries in Recursion Theory
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Nº de ref. del artículo: 5975588
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic, 16)
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: ria9780817639662_new
Cantidad disponible: Más de 20 disponibles