Více než 4 miliony titulů v angličtině i dalších jazycích! Objevte svůj nový příběh ještě dnes!

Bounded Queries in Recursion Theory

Name: Bounded Queries in Recursion Theory
Brand: Springer-Verlag New York Inc.
SKU: 9781461268482
Price: 2286 CZK
Availability: InStock

Autor: William Levine, Georgia Martin

Jazyk:

Vazba: Brožovaná

Vydavatel: Springer-Verlag New York Inc.

Dostupnost: Skladem u dodavatele

Odesíláme za 5-8 dnů

2 286 Kč

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

Informace o knize

Autor

William Levine, Georgia Martin

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2013

Stránek

353

EAN

9781461268482

ISBN

1461268486

Enbook ID

02253490

Vydavatel

Springer-Verlag New York Inc.

Hmotnost

569

Rozměry

155 x 235 x 21

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.