Talk:Anonymous recursion: Difference between revisions

Content deleted Content added
WP
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computer science}}.
 
(4 intermediate revisions by 3 users not shown)
Line 1:
{{WikiProject Computerbanner scienceshell|class=C|importance=low}}
{{WikiProject Computer science|importance=low}}
 
}}
==Cleanup==
 
Line 67 ⟶ 68:
I’ve accordingly expanded this page into a proper article – hope it looks good, and please improve it!
:—Nils von Barth ([[User:Nbarth|nbarth]]) ([[User talk:Nbarth|talk]]) 06:02, 27 April 2013 (UTC)
 
== Simpler solution ==
I came up with a simpler lambda calculus solution for factorial. All I did was take the anonymous recursion version, and replace "lambda a, b" with "lambda a: lambda b:", and "(a, b)" with "(a)(b)".
 
<syntaxhighlight lang=python>
(lambda f: lambda x: f(f)(x)) \
(lambda f: lambda x: 1 if x == 0 else x * f(f)(x-1))
</syntaxhighlight>
 
But, this is original research I guess, so I won't put it on the page. Also the existing explanation might help people trying to understand the Y combinator. <small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/15.203.233.79|15.203.233.79]] ([[User talk:15.203.233.79|talk]]) 22:19, 27 April 2015 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->