Jump to content

Talk:Course-of-values recursion

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 00:05, 9 March 2024 (Maintain {{WPBS}}: 1 WikiProject template. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Merge?

[edit]

Is there opposition to merging this into Primitive recursive function? CMummert 16:39, 26 October 2006 (UTC)[reply]

Never mind; I expanded it in place. CMummert · talk 23:58, 22 February 2007 (UTC)[reply]

Misleading sentence

[edit]

As far as I cans tell "the value of f(n+1) is computed from the sequence" sentence at the beginning of the article is misleading. It should be:

"the value of f(n+1) is computed from the sequence by a primitive recursive function".

At first I was very puzzled, then I kept reading the full article and indeed it is explained below that h must be primitive-recursive. — Preceding unsigned comment added by 88.191.80.254 (talk) 09:18, 15 May 2018 (UTC)[reply]