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, 16) - Tapa dura

Martin, G.; Gasarch, W.; Gasarch, William I.

 
9780817639662: Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)
Tapa dura
ISBN 10: 0817639667 ISBN 13: 9780817639662
Editorial: Birkhäuser, 1998

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.

Editorial
Birkhäuser
Año de publicación
1998
Idioma
Inglés
ISBN 10 
0817639667
ISBN 13 
9780817639662
Encuadernación
Tapa dura
Número de páginas
376
Contacto del fabricante
no disponible
Persona responsable
GPSR Kontakt
gpsr@libri.de

Europaallee 1
Bad Hersfeld
36244
Alemania