Re:Russell's paradox and the Y combinator
by srtjstjsj on Tuesday June 02, 2015 @08:14PM
(#9649858)
How is this example special, compared to the general notion:
so, any set F that is defined in terms of how sets (functions) relate to themselves, fits into the Y combinator. Which is expected, since Y is the essence of recursion.
[ Parent
| on HN ]
I don't know that there's anything special about Russell's paradox in particular, to be honest. It has obvious historical importance, obviously, but I doubt that's what you're looking for.
There's something a bit remarkable about how trivial it is, I suppose. Booleans are very simple types, if you'll give me those, and then Not is the only involution!