Jump to content

Talk:Double recursion

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gerard van Novaloka (talk | contribs) at 21:30, 12 February 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Oooh, this is a badly written article. It's simple, there are two iterators, but not yet an Ackermann function. I mean this double recursion still defines a primitive recursive function! Only as soon as the two iterator parameters are defined with the same variable is it an Ackermann function. I mean if you'd define an Ackermann function like is done here (a function index is a function variable) then in a sense Hilbert already defined such a function in his "On the Infinite" article that was the inspiration for Ackermann. I suppose we just have to follow the definition of Rozsa Peter and not much additional speculative talk. But it takes an overhaul of the page and for me if I'd do it the moderators would undo this again so I won't. Credentials eh? --Gerard van Novaloka (talk) 21:19, 12 February 2011 (UTC)[reply]