Talk:Anonymous recursion: Difference between revisions

Content deleted Content added
What does "anonymous" mean in this context?
Gerbrant (talk | contribs)
"anonymous"?: Anonymous!
Line 30:
 
=="anonymous"?==
 
What does "anonymous" mean in this context? [[User:Michael Hardy|Michael Hardy]] 03:55, 15 November 2005 (UTC)
:I'm not an expert in these mattres, but I think the "anonymous" in "anonymous recursive function" means that it doesn't need to have a name assigned. I gather it's okay to take it litterally. ("anonymous" < Greek: an- "without" + onyma, Æolic dialectal form of onoma "name", thus "without a name", "nameless", "unnamed")
:For instance, λx(x + 2) is an anonymous function. You can write down stuff like (λx(x + 2))3 and the result is 5.
:However, if you want to define a recursive function, you would have to name it to be able to write down things like f(x) = ...f(x - 1)... This article shows that you can actually define anonymous recursive functions without naming them. Everything clear? [[User:Gerbrant|Shinobu]] 03:51, 2 March 2006 (UTC)