Talk:Course-of-values recursion

	This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:
Mathematics Low‑priority This 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. Low This article has been rated as Low-priority on the project's priority scale.

Merge?

Latest comment: 18 years ago2 comments1 person in discussion

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

Latest comment: 7 years ago1 comment1 person in discussion

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