Editing Turing reduction (section)

== References ==

* M. Davis, ed., 1965.  ''The Undecidable&mdash;Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions'', Raven, New York. Reprint, Dover, 2004. {{isbn|0-486-43228-9}}.
* S. C. Kleene, 1952. Introduction to Metamathematics. Amsterdam: North-Holland.
* S. C. Kleene and E. L. Post, 1954. "The upper semi-lattice of degrees of recursive unsolvability". ''[[Annals of Mathematics]]'' v. 2 n. 59, 379–407.
* {{ cite journal
   | last = Post
   | first = E. L.
   | author-link = Emil Leon Post
   | title = Recursively enumerable sets of positive integers and their decision problems
   | journal = [[Bulletin of the American Mathematical Society]]
   | volume = 50
   | year = 1944
   | issue = 5
 | pages = 284–316
   | url = http://projecteuclid.org/download/pdf_1/euclid.bams/1183505800
   | format = [[PDF]]
   | accessdate = 2015-12-17
   | doi=10.1090/s0002-9904-1944-08111-1| doi-access = free
   }}
* A. Turing, 1939. "Systems of logic based on ordinals." ''[[Proceedings of the London Mathematical Society]]'', ser. 2 v. 45, pp.&nbsp;161–228. Reprinted in "The Undecidable", M. Davis ed., 1965.
* [[Hartley Rogers|H. Rogers]], 1967. Theory of recursive functions and effective computability. McGraw-Hill.
* [[Robert I. Soare|R. Soare]], 1987. Recursively enumerable sets and degrees, Springer.
* {{ cite journal
   | last = Davis
   | first = Martin
   | author-link = Martin Davis (mathematician)
   | title = What is...Turing Reducibility?
   | journal = [[Notices of the American Mathematical Society]]
   |date=November 2006
   | volume = 53
   | issue = 10
   | pages =1218–1219
   | url = http://www.ams.org/notices/200610/whatis-davis.pdf
   | accessdate = 2008-01-16 }}