Applying Turing Completeness (Cont)
2. a way to represent an a tape of whatever size may be needed by the computation, and to represent on each square of the tape, any tape symbol from a finite set (no matter how many symbols may be in TM’s finite set):
a dynamically growable array or a linked-list construction capability.
Each element of the array or list must be able to represent an integer in the range {0, …, m-1} where m is the size of ?. It must be possible to read and write any element of the array or list and to simulate moving the tape head left or right.