Abstract
In this chapter we present some basic results about K, the halting set. Not only are these results important—perhaps even surprising—in and of themselves, but they also give the reader a feel for the kinds of considerations that arise in the treatment of bounded queries throughout the book.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Bounded Queries and the Halting Set. 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_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0635-4_2
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