Tallenna
Bounded Queries in Recursion Theory
Kirjailija:
nidottu, 2013
englanti
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.
- Kirjailija
- William Levine, Georgia Martin
- Painos
- Softcover reprint of the original 1st ed. 1999
- ISBN
- 9781461268482
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 13.7.2013
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 353
