The solution in a nutshell: Design our machine/model with unbounded indirectionprovide an "unbounded" "address" register that can potentially name (call out) any register no matter how many there are. For this to work, in general, the "unbounded" register requires an ability to be cleared and then incremented (and, possibly, decremented) by a potentially infinite loop. In this sense the solution represents the unbounded μ operator that can, if necessary, hunt ad infinitim along the unbounded string of registers until it finds what it is looking for. The pointer register is exactly like any other register with one exception: under the circumstances called "indirect addressing" it provides "its" contents, rather than the address-operand in the state machine's TABLE, to be the address of the target register (including possibly itself!).