Bounded Queries in Recursion Theory
Produktnummer:
18cd9f94af455342439fff56f2ecbd69b2
| Autor: | Levine, William Martin, Georgia |
|---|---|
| Themengebiete: | Computability Theory Notation algorithms complexity computer computer science simulation theoretical computer science time |
| Veröffentlichungsdatum: | 23.12.1998 |
| EAN: | 9780817639662 |
| Sprache: | Englisch |
| Seitenzahl: | 353 |
| Produktart: | Gebunden |
| Verlag: | Birkhäuser Boston |
Produktinformationen "Bounded Queries in Recursion Theory"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen