Artículo: AMZ-B000W98WU4

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

Format:

Kindle

Hardcover

Kindle

Paperback

Detalles del producto
Disponibilidad
Sin stock
Peso con empaque
0.84 kg
Devolución
No
Condición
Nuevo
Producto de
Amazon
Viaja desde
USA

Sobre este producto
  • 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.

Sin stock

Seleccione otra opción o busque otro producto.

Este producto viaja de USA a tus manos en

Conoce más detalles

Highlight, take notes, and search in the book In this edition, page numbers are just like the physical edition