Reduction (computability theory): Difference between revisions

Revision as of 04:07, 13 March 2015

Revision as of 01:08, 20 June 2017

Line 52:

== References ==

* K. Ambos-Spies and P. Fejer, 2006. "[http://www.cs.umb.edu/~fejer/articles/History_of_Degrees.pdf Degrees of Unsolvability]." Unpublished preprint.

* P. Odifreddi, 1989. ''Classical Recursion Theory'', North-Holland. ISBN {{isbn|0-444-87295-7}}

* P. Odifreddi, 1999. ''Classical Recursion Theory, Volume II'', Elsevier. ISBN {{isbn|0-444-50205-X}}

*E. Post, 1944, "Recursively enumerable sets of positive integers and their decision problems", ''Bulletin of the American Mathematical Society'', volume 50, pages 284–316.

* H. Rogers, Jr., 1967. ''The Theory of Recursive Functions and Effective Computability'', second edition 1987, MIT Press. ISBN {{isbn|0-262-68052-1}} (paperback), ISBN {{isbn|0-07-053522-1}}

* G Sacks, 1990. ''Higher Recursion Theory'', Springer-Verlag. ISBN {{isbn|3-540-19305-7}}

[[Category:Computability theory]]