Content deleted Content added
→"anonymous"?: four years of thrash info |
→Factually disputed: new section |
||
Line 41:
Should the second step perhaps be: replace f(x-1) by f(x-1,f) ? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/128.176.181.114|128.176.181.114]] ([[User talk:128.176.181.114|talk]]) 20:47, 7 July 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== Factually disputed ==
Besides the fact that [[anonymous function]] is not a well-defined concept, the construction given in this article uses names for functions; so how is this recursion anonymous?
This article appears to be the product of somebody with a poor understanding of [[lambda calculus]], where functions are indeed anonymous, in that we don't ''need'' to give them names, you can just write well formed expressions in the calculus. But then this article is nothing more than an application of some fix-point combinator; whether it's Y or not, it doesn't really matter, because [[Fixed_point_combinator#Other_fixed_point_combinators|there's an infinity of fix-point combinators]]. [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 01:42, 21 August 2009 (UTC)
|