Bounded Queries in Recursion Theory / Progress in Computer Science and Applied Logic Bd.16 (PDF)
(Sprache: Englisch)
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...
sofort als Download lieferbar
eBook (pdf)
Fr. 118.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Bounded Queries in Recursion Theory / Progress in Computer Science and Applied Logic Bd.16 (PDF)“
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.
Bibliographische Angaben
- Autoren: William Levine , Georgia Martin
- 2012, 1999, 353 Seiten, Englisch
- Verlag: Birkhäuser Boston
- ISBN-10: 1461206359
- ISBN-13: 9781461206354
- Erscheinungsdatum: 06.12.2012
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 33 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Bounded Queries in Recursion Theory / Progress in Computer Science and Applied Logic Bd.16"
0 Gebrauchte Artikel zu „Bounded Queries in Recursion Theory / Progress in Computer Science and Applied Logic Bd.16“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Bounded Queries in Recursion Theory / Progress in Computer Science and Applied Logic Bd.16".
Kommentar verfassen