Erweiterte
Suche ›

Bounded Queries in Recursion Theory

Birkhäuser Boston,
Buch
139,09 € Lieferbar in 5-7 Tagen
Dieses Produkt ist auch verfügbar als:

Kurzbeschreibung

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.

Details
Schlagworte

Titel: Bounded Queries in Recursion Theory
Autoren/Herausgeber: William S. Levine, Georgia Martin
Aus der Reihe: Progress in Computer Science and Applied Logic
Ausgabe: 1999

ISBN/EAN: 9780817639662

Seitenzahl: 353
Format: 23,5 x 15,5 cm
Produktform: Hardcover/Gebunden
Gewicht: 1,550 g
Sprache: Englisch

buchhandel.de - Newsletter
Möchten Sie sich für den Newsletter anmelden?


Bitte geben Sie eine gültige E-Mail-Adresse ein.
Lieber nicht