Abstract
After his epochal paper in 1936 on Turing machines, Turing wrote a Ph.D. dissertation with Alonzo Church which was published in 1939. A tiny part of this paper in section 4 contained the germ of one of the most important ideas in all of modern computability theory. In half a page Turing suggested augmenting his formera-machines by adding some kind of “oracle” which could supply the answers to specific questions during the computation.
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
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soare, R.I. (2016). Turing Reducibility. In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_3
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)