Bounded Queries in Recursion Theory

Name: Bounded Queries in Recursion Theory
Brand: Birkhauser Boston Inc
SKU: 9780817639662
Price: 106.19 EUR
Availability: InStock

Autor: William Gasarch, Georgia Martin

Jazyk:

Väzba: Pevná

Vydavateľ: Birkhauser Boston Inc

Dostupnosť: Skladom u dodávateľa v malom množstve

Odosielame za 13-18 dní

106.19 €

One of the major concerns of theoretical computer science is the classifi cation of problems in term...

Informácie o knihe

Autor

William Gasarch, Georgia Martin

Jazyk

Angličtina

Väzba

Kniha - Pevná

Vydalo

1998

Stránok

353

EAN

9780817639662

ISBN

0817639667

Enbook ID

01399169

Vydavateľ

Birkhauser Boston Inc

Hmotnosť

1550

Rozmery

155 x 235 x 25

Kompletný popis

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.

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Bounded Queries in Recursion Theory

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež