Revision as of 09:16, 3 February 2024 edit Regulov (talk \| contribs) Extended confirmed users 28,152 edits m →Some common primitive recursive functions ← Previous edit		Revision as of 16:38, 3 February 2024 edit undo Jochen Burghardt (talk \| contribs) Extended confirmed users 24,302 edits →References: rm stray nonterminal-symbol Next edit →
Line 398: * [[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}} * [[Stephen Kleene]] (1952) ''Introduction to Metamathematics'', North-Holland Publishing Company, New York, 11th reprint 1971: (2nd edition notes added on 6th reprint). In Chapter XI. General Recursive Functions §57~~'''Bold text'''~~ * [[George Boolos]], [[John P. Burgess\|John Burgess]], [[Richard Jeffrey]] (2002), ''Computability and Logic: Fourth Edition'', Cambridge University Press, Cambridge, UK. Cf pp. 70–71. * Robert I. Soare 1995 ''Computability and Recursion'' http://www.people.cs.uchicago.edu/~soare/History/compute.pdf

Primitive recursive function: Difference between revisions