Russell's paradox: The set that contains all the sets that do not contain themselves. Does it contain itself? It contains itself if and only if it does not contain itself.
Russell's paradox for the lambda-calculus: The functions that may not be applied to themselves when combined with themselves, they negate themselves.
lambda calculus uses anonymous functions called lambda-expressions. So, the paradox re-stated in lambda-calculus terms becomes:
The lambda-expressions that may not be applied to themselves when combined with themselves, they negate themselves.
If such a lambda-expression is encoded into a string w, then input to a Turing machine, will the Turing machine (Paradox Recognizer machine) accept it? not accept it: reject it? or loop forever?
Thanks in advance for your comments.