Content deleted Content added
→Literature survey and conclusion: new section |
→Factually disputed: note another solved issue |
||
Line 45:
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?
: '''Update''': Not well-defined in the context of lambda calculus and mathematics, see [[Talk:Fixed_point_combinator#.22Fixed_point_combinators_allow_the_definition_of_anonymous_recursive_functions.22|this rant]]; it is fairly well defined in programming, but this article tried to be too far removed from that.
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)
| |||