Revision as of 13:40, 28 February 2024 edit Janburse (talk \| contribs) Extended confirmed users 1,136 edits →Computable function that is not primitive recursive ← Previous edit		Revision as of 13:51, 28 February 2024 edit undo Janburse (talk \| contribs) Extended confirmed users 1,136 edits →Computable function that is not primitive recursive Next edit →
Line 361: :Good point. I changed "computable" to "total recursive" in that sentence. [[User:JRSpriggs\|JRSpriggs]] ([[User talk:JRSpriggs\|talk]]) 04:56, 23 April 2015 (UTC) :: BTW: The ackerman function is such a function. It is not primitive recursive. And its total. The proof goes usually by majorization. In terms of LOOP/WHILE one would show that for every program with n-LOOPs there is some ackerman function invocation, that grows more than the n-LOOPs program. By this majorization, one can show that the ackeman function cannot be implemented by a LOOP-program. ~~:: But you are not alone, David Hilbert believed the same, until the discovery of the [[Ackermann function]] showed the contrary.~~ ~~:: [[User:Janburse\|Jan Burse]] ([[User talk:Janburse\|talk]]) 13:40, 28 February 2024 (UTC)~~ == Floop issue. ==

Talk:Primitive recursive function: Difference between revisions