Talk:Course-of-values recursion: Difference between revisions

Revision as of 21:30, 17 June 2016

Latest revision as of 00:05, 9 March 2024

(4 intermediate revisions by 4 users not shown)

Line 1:

{{mathsWikiProject ratingbanner shell|class=Start|priority=Low|field=foundations}}

{{WikiProject Mathematics|priority=Low}}

}}

== Merge? ==

<s>Is there opposition to merging this into [[Primitive recursive function]]?</s> [[User:CMummert|CMummert]] 16:39, 26 October 2006 (UTC)

:Never mind; I expanded it in place. [[User:CMummert|CMummert]] · <small>[[User talk:CMummert|talk]]</small> 23:58, 22 February 2007 (UTC)

== Ackermann'sMisleading function?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:

Is it worth adding an explanation why this can't be done with [[Ackermann's function]]?[[User:Dan Gluck|Dan Gluck]] ([[User talk:Dan Gluck|talk]]) 21:30, 17 June 2016 (UTC)

"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. <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/88.191.80.254|88.191.80.254]] ([[User talk:88.191.80.254#top|talk]]) 09:18, 15 May 2018 (UTC)</small> <!--Autosigned by SineBot-->