Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (10 chapters)
-
Getting Your Feet Wet
-
The Complexity of Functions
-
The Complexity of Sets
-
Miscellaneous
Keywords
About this book
Reviews
"Ideal for an advanced undergraduate or beginning graduate student who has some exposure to basic computability theory and wants to see what one can do with it. The questions asked are interesting and can be easily understood and the proofs can be followed without a large amount of training in computability theory."
--Sigact News
Authors and Affiliations
Bibliographic Information
Book Title: Bounded Queries in Recursion Theory
Authors: William I. Gasarch, Georgia A. Martin
Series Title: Progress in Computer Science and Applied Logic
DOI: https://doi.org/10.1007/978-1-4612-0635-4
Publisher: Birkhäuser Boston, MA
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1999
Hardcover ISBN: 978-0-8176-3966-2Published: 23 December 1998
Softcover ISBN: 978-1-4612-6848-2Published: 13 July 2013
eBook ISBN: 978-1-4612-0635-4Published: 06 December 2012
Series ISSN: 2297-0576
Series E-ISSN: 2297-0584
Edition Number: 1
Number of Pages: XIII, 353
Topics: Math Applications in Computer Science, Operator Theory, Theory of Computation, Discrete Mathematics in Computer Science, Computational Mathematics and Numerical Analysis, Applications of Mathematics
Industry Sectors: IT & Software