Content deleted Content added
→Variants: The Fischer, Fischer, Beigel paper is complete rubbish. They reprove things known decades earlier, and conjecture things also refuted decades earlier. |
|||
Line 350:
== References ==
* {{cite book|last1=Brainerd |first1=W.S. |last2=Landweber |first2=L.H. |year=1974 |title=Theory of Computation |publisher=Wiley |isbn=0471095850}}
* {{cite book|last=Hartmanis |first=Juris |author-link=Juris Hartmanis |year=1989|chapter=Overview of Computational Complexity Theory |title=Computational Complexity Theory |publisher=American Mathematical Society|pp=1-17 |isbn=978-0-8218-0131-4 |series=Proceedings of Symposia in Applied Mathematics |volume=38 |mr=1020807}}
* [[Robert I. Soare]], ''Recursively Enumerable Sets and Degrees'', Springer-Verlag, 1987. {{isbn|0-387-15299-7}}
Line 357 ⟶ 356:
* Robert I. Soare 1995 ''Computability and Recursion'' http://www.people.cs.uchicago.edu/~soare/History/compute.pdf
* Daniel Severin 2008, ''Unary primitive recursive functions'', J. Symbolic Logic Volume 73, Issue 4, pp. 1122–1138 [https://arxiv.org/abs/cs/0603063v3 arXiv] [https://projecteuclid.org/euclid.jsl/1230396909 projecteuclid] {{doi|10.2178/jsl/1230396909}} {{JSTOR|275903221}}
* Raphael M. Robinson (1947), ''Primitive recursive functions'', Bulletin of the AMS 53, no. 10, pp. 925–942.
* M. D. Gladstone (1967), ''A reduction of the recursion scheme'', Journal of Symbolic Logic 32, no. 4, pp. 505–508.
* M. D. Gladstone (1971), ''Simplifications of the recursion scheme'', Journal of Symbolic Logic 36, no. 4, pp. 653–665.
{{Mathematical logic}}
|