Applying Turing Completeness (Cont)
1. a way to represent the current state of a TM computation, no matter how many states the TM may have:
If there are n states in ?, then the variable must be able to handle any number in the range {0, …, n-1}.
(For large numbers of states, we could use several integer variables. In principle we may need either one “bignum” or an arbitrary finite number of fixed-precision integer variables.)