T = EQ<n,n> ; T .
Since n=n always, this will recursive forever.
T = NEQ<n,n> ; T .
Since n!=n is never true, this will stop after one iteration of the body, which in this case is just the NEQ process.
-- (c) Fordham University Robotics and Computer Vision