Talk:Y combinator: Difference between revisions
Content added Content deleted
| Line 51: | Line 51: | ||
: I first would analyze why the code author wrote «The usual version» about the recursion one. Maybe it's more natural to Haskell (or functional languages in general)? --[[User:ShinTakezou|ShinTakezou]] 09:34, 20 May 2009 (UTC) |
: I first would analyze why the code author wrote «The usual version» about the recursion one. Maybe it's more natural to Haskell (or functional languages in general)? --[[User:ShinTakezou|ShinTakezou]] 09:34, 20 May 2009 (UTC) |
||
::Hi ShinTakezou, The idea behind the Y combinator is to create recursion without explicit recursion. It is akin to asking for a Bogosort and getting back some other sort. It isn't what the task has asked for. |
|||
::Just as it would be pointless to actually use Bogosort in the real world, it is missing the point to show a recursive fibonacci generator when a Y-combinator one was asked for. --[[User:Paddy3118|Paddy3118]] 20:19, 20 May 2009 (UTC) |
|||