Playing chicken with the halting problem:

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?"

This operation is "Oh no" 😂

@ScriptCoded I love that.