Re:Is there an algorithm as beautiful as a poem?
by tromp on Sunday June 16, 2024 @06:32AM
(#40696017)
I would say the combinator \x\y\z.x z (y (\t.z)) is more poetic than Y, since it forms a basis for combinatory logic all by itself. Not only can you make Y from it, but every other combinator as well. And it's the smallest term with that property.
[ Parent
| on HN ]
There are no comments on this comment yet.