Bounded queries in computability theory

Rubriek: Textual/Printed/Reference Materials - Boek

Prijs: € 99.99

Rating: 0/5

☆

☆

☆

☆

☆

Verzending:
3 weken

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). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.



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.

• 1 Bekijk alle specificaties

Taal: en

Bindwijze: Hardcover

Oorspronkelijke releasedatum: 23 december 1998

Aantal pagina's: 372

Illustraties: Nee

Hoofdauteur: William Gasarch

Tweede Auteur: Georgia Martin

Co Auteur: Georgia Martin

Hoofduitgeverij: Birkhauser Boston Inc

Editie: 1999 ed.

Extra groot lettertype: Nee

Product breedte: 155 mm

Product lengte: 235 mm

Studieboek: Ja

Verpakking breedte: 155 mm

Verpakking hoogte: 25 mm

Verpakking lengte: 235 mm

Verpakkingsgewicht: 719 g

EAN: 9780817639662

---