Revision as of 15:41, 14 April 2020 edit OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: doi added to citation with #oabot. ← Previous edit		Latest revision as of 22:05, 18 January 2024 edit undo Citation bot (talk \| contribs) Bots 5,866,771 edits Added issue. \| Use this bot. Report bugs. \| Suggested by Abductive \| Category:Computability theory \| #UCB_Category 89/100
Line 4: * ''G''(0, ''x'') is a given function of ''x''. * ''G''(''n'' + 1, 0) is obtained by substitution from the function ''G''(''n'', ·) and given functions. * ''G''(''n'' + 1, ''x'' + 1) is obtained by substitution from ''G''(''n'' + 1, ''x''), the function ''G''(''n'', ·) and given functions.<ref>{{cite journal \| author=Raphael M. Robinson \| title=Recursion and Double Recursion \| journal=[[Bulletin of the American Mathematical Society]] \| year=1948 \| volume=54 \| issue=10 \| pages=987–93 \| url=http://projecteuclid.org/DPubS?verb=Display&version=1.0&service=UI&handle=euclid.bams/1183512393&page=record \| doi=10.1090/S0002-9904-1948-09121-2\| doi-access=free }}</ref> Robinson goes on to provide a specific double recursive function (originally defined by [[Rózsa Péter]])

Double recursion: Difference between revisions