Anonymous user
Talk:Y combinator: Difference between revisions
Slate entry incomplete?
(Slate entry incomplete?) |
|||
Line 53:
::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)
==Slate entry incomplete?==
Thanks for adding another language implementation, but:
:''"The task is to define the stateless Y combinator and use it to compute factorials and Fibonacci numbers from other stateless functions or lambda expressions."''
Unfortunately you haven't defined it, and it seems as if it hasn't been used to compute the two functions. --[[User:Paddy3118|Paddy3118]] 05:54, 5 June 2009 (UTC)
| |||