Ponad 4 miliony tytułów w języku angielskim i innych językach! Odkryj swoją nową historię już dziś!

Bounded Queries in Recursion Theory

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

Autor: William Levine, Georgia Martin

Język:

Oprawa: Miękka

Wydawca: Springer-Verlag New York Inc.

Dostępność: Dostępna u dostawcy

Wysyłamy za 5-8 dni

433.29 zł

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

Informacje o książce

Autor

William Levine, Georgia Martin

Język

Angielski

Oprawa

Książka - Miękka

Data wydania

2013

strony

353

EAN

9781461268482

ISBN

1461268486

Enbook ID

02253490

Wydawca

Springer-Verlag New York Inc.

Waga

569

Wymiary

155 x 235 x 21

Pełny opis

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.