Bounded Queries in Recursion Theory

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

Autor: William Gasarch, Georgia Martin

Jazyk:

Vazba: Pevná

Vydavatel: Birkhauser Boston Inc

Dostupnost: Skladem u dodavatele v malém množství

Odesíláme za 13-18 dnů

2 567 Kč

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

Informace o knize

Autor

William Gasarch, Georgia Martin

Jazyk

Angličtina

Vazba

Kniha - Pevná

Vydáno

1998

Stránek

353

EAN

9780817639662

ISBN

0817639667

Enbook ID

01399169

Vydavatel

Birkhauser Boston Inc

Hmotnost

1550

Rozměry

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 zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Bounded Queries in Recursion Theory

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také