Abstract
In this chapter we present some material from recursion theory that is requisite to understanding the material in later chapters. In Section 1.1 we introduce notation, conventions, and definitions to be used throughout the book. In Section 1.2 we present further notation and definitions and review some basics from recursion theory. In Section 1.3 we present some concepts from recursion theory that are standard tools of the trade for recursion theorists but may seem a bit more advanced to beginners. In Section 1.4 we present several specialized concepts and results from recursion theory that are later applied to the study of bounded queries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gasarch, W.I., Martin, G.A. (1999). Basic Concepts. In: Bounded Queries in Recursion Theory. Progress in Computer Science and Applied Logic, vol 16. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0635-4_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0635-4_1
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6848-2
Online ISBN: 978-1-4612-0635-4
eBook Packages: Springer Book Archive