2
lorentz
1y

Playing chicken with the halting problem:

Comments
  • 2
    The operation is breadth-first search over the evaluation paths of a lambda expression, where a valid step is either a B-reduction or one of a few hand-picked identities specifically to deal with simple cases of infinite recursion. The question is literally "do these lambda expressions ever differ when evaluated in normal order?"
  • 5
    This operation is "Oh no" 😂
  • 1
Add Comment