Bounded Queries in Recursion Theory

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

Autor: William Gasarch, Georgia Martin

Limbă:

Legare: Copertă tare

Editura: Birkhauser Boston Inc

Disponibilitate: În depozitul extern în cantități mici

Expediem în 13-18 zile

581.45 lei

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

Informații despre carte

Autor

William Gasarch, Georgia Martin

Limbă

engleză

Legare

Carte - Copertă tare

Publicat

1998

Pagini

353

EAN

9780817639662

ISBN

0817639667

Enbook ID

01399169

Editura

Birkhauser Boston Inc

Greutate

1550

Dimensiuni

155 x 235 x 25

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Bounded Queries in Recursion Theory

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și