Jump to content

Talk:Course-of-values recursion

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 88.191.80.254 (talk) at 09:18, 15 May 2018 (→Misleading sentence: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Merge?

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

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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Course-of-values_recursion&oldid=841349756"