Primitive recursive function: Difference between revisions

Revision as of 21:20, 4 January 2025

Revision as of 21:41, 4 January 2025

Line 352:

* [[Juris Hartmanis]] (1989), “Overview of computational Complexity Theory” in J. Hartmanis (ed.), Computational Complexity Theory, Providence: American Mathematical Society, pp. 1–17.

* [[Robert I. Soare]], ''Recursively Enumerable Sets and Degrees'', Springer-Verlag, 1987. {{isbn|0-387-15299-7}}

* [[{{Cite book |last=Kleene |first=Stephen Cole |author-link=Stephen Cole Kleene]] (|year=1952) ''|title=Introduction to Metamathematics'', North-Holland|edition=7th Publishing Company, New York, 11th[1974] reprint; 1971: (2nd edition|publisher=[[North-Holland notesPublishing addedCompany]] on 6th reprint).|oclc=3757798 In|isbn=0444100881}} Chapter XI. General Recursive Functions §57

*{{citation [[|author-link=George Boolos]], [[|first1=George |last1=Boolos |author2-link=John P. Burgess |first2=John |last2=Burgess]], [[|author3-link=Richard Jeffrey]] (2002),|first3=Richard ''|last3=Jeffrey |title=Computability and Logic: Fourth Edition'', |publisher=Cambridge University Press, Cambridge,|edition=4th UK.|date=2002 Cf|isbn=9780521007580 pp. |pages=70–71.}}

* 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}}