Double recursion: Difference between revisions

Revision as of 18:43, 9 December 2009

Latest revision as of 22:05, 18 January 2024

(6 intermediate revisions by 6 users not shown)

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''&nbsp;+&nbsp;1,&nbsp;''x''&nbsp;+&nbsp;1) is obtained by substitution from ''G''(''n''&nbsp;+&nbsp;1,&nbsp;''x''), the function ''G''(''n'',&nbsp;·) 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]])

Line 19:

{{reflist}}

{{mathmathlogic-stub}}

[[Category:RecursionComputability theory]]

[[Category:Recursion]]