Re:Is there an algorithm as beautiful as a poem?
by JohnKemeny on Sunday June 16, 2024 @03:38AM
(#40695356)
λx.(λx.f(xx))(λx.f(xx))
[ Parent
| on HN ]
Re:Is there an algorithm as beautiful as a poem?
by tromp on Sunday June 16, 2024 @03:52AM
(#40695422)
That ignores its first argument x.
You mean the fixpoint combinator λf.(λx.f(x x))(λx.f(x x)), or λf.(λx.x x)(λx.f(x x)), or as a lambda diagram:
────┬────
┬─┬ ┼─┬─┬
└─┤ │ ├─┘
│ ├─┘
└─┘
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.