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.
| Autorius: | Georgia Martin, William Levine, |
| Serija: | Progress in Computer Science and Applied Logic |
| Leidėjas: | Birkhäuser Boston |
| Išleidimo metai: | 1998 |
| Knygos puslapių skaičius: | 372 |
| ISBN-10: | 0817639667 |
| ISBN-13: | 9780817639662 |
| Formatas: | Knyga kietu viršeliu |
| Kalba: | Anglų |
| Žanras: | Functional analysis and transforms |
Parašykite atsiliepimą apie „Bounded Queries in Recursion Theory“
