Talk:Course-of-values recursion: Difference between revisions
Content deleted Content added
Tag: |
m Maintain {{WPBS}}: 1 WikiProject template. Remove 1 deprecated parameter: field. Tag: |
||
| Line 1: | Line 1: | ||
{{WikiProject banner shell|class=Start| |
{{WikiProject banner shell|class=Start| |
||
{{WikiProject Mathematics|priority=Low |
{{WikiProject Mathematics|priority=Low}} |
||
}} |
}} |
||
== Merge? == |
== Merge? == |
||
Latest revision as of 00:05, 9 March 2024
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Merge?
[edit]Is there opposition to merging this into Primitive recursive function? CMummert 16:39, 26 October 2006 (UTC)
- Never mind; I expanded it in place. CMummert · talk 23:58, 22 February 2007 (UTC)
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)