Abstract
We have seen in Chapter 5 how Post tried to solve Post's Problem 5.1.1 by defining c.e. sets A with ever thinner complements. Post himself did not live to see the refutation of this approach by [Friedberg 1958], who constructed a maximal set with the thinnest complement of all, and the construction of a complete maximal set by Yates, which refuted Post's approach. Post moved on to understand full Turing reducibility in [Post 1944]. He gave an excellent intuitive description of one set being Turing reducible to another.
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
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soare, R.I. (2016). Oracle Constructions and Forcing. In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31932-7
Online ISBN: 978-3-642-31933-4
eBook Packages: Computer ScienceComputer Science (R0)