Revision as of 21:52, 4 January 2025 edit Tule-hog (talk \| contribs) Extended confirmed users 6,834 edits format refs ← Previous edit		Revision as of 21:53, 4 January 2025 edit undo Tule-hog (talk \| contribs) Extended confirmed users 6,834 edits →References: add year Next edit →
Line 350: * {{cite book\|last1=Brainerd \|first1=W.S. \|last2=Landweber \|first2=L.H. \|year=1974 \|title=Theory of Computation \|publisher=Wiley \|isbn=0471095850}} * {{cite journal \| last1=Fischer \| first1=Michael J. \| last2=Fischer \| first2=Robert P. \| last3=Beigel \| first3=Richard \| title=Primitive Recursion without Implicit Predecessor \| journal=[[ACM SIGACT\|ACM SIGACT News]] \|date=November 1989 \| volume=20\| issue=4\| pages=87–91 \| url=https://doi.org/10.1145/74074.74089 \| doi=10.1145/74074.74089\| s2cid=33850327 }} * {{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}} * {{Cite book \|last=Kleene \|first=Stephen Cole \|author-link=Stephen Cole Kleene \|year=1952\|title=Introduction to Metamathematics \|edition=7th [1974] reprint; 2nd \|publisher=[[North-Holland Publishing Company]] \|oclc=3757798 \|isbn=0444100881}} Chapter XI. General Recursive Functions §57

Primitive recursive function: Difference between revisions