Author	Gasarch, William I. author
Title	Bounded Queries in Recursion Theory [electronic resource] / by William I. Gasarch, Georgia A. Martin
Imprint	Boston, MA : Birkhรคuser Boston : Imprint: Birkhรคuser, 1999
Connect to	http://dx.doi.org/10.1007/978-1-4612-0635-4
Descript	XIII, 353 p. online resource

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

A: Getting Your Feet Wet -- 1 Basic Concepts -- 2 Bounded Queries and the Halting Set -- 3 Definitions and Questions -- B: The Complexity of Functions -- 4 The Complexity of CnA -- 5 #nA and Other Functions -- C: The Complexity of Sets -- 6 The Complexity of ODDnA and MODmnA -- 7 Q Versus QC -- 8 Separating and Collapsing Classes -- D: Miscellaneous -- 9 Nondeterministic Complexity -- 10 The Literature on Bounded Queries -- References

1. Computer science
2. Computers
3. Computer science -- Mathematics
4. Operator theory
5. Applied mathematics
6. Engineering mathematics
7. Computer mathematics
8. Computer Science
9. Math Applications in Computer Science
10. Operator Theory
11. Theory of Computation
12. Discrete Mathematics in Computer Science
13. Computational Mathematics and Numerical Analysis
14. Applications of Mathematics