Applying Turing Completeness (Cont)
3. a way to implement any TM’s transition function:
Either: nestable conditionals (IF constructs) or conditionals with compound conditions, and the ability to compare the current state with an arbitrary state, and compare the current tape symbol with an arbitrary symbol.
Changing the state would presumably be done by assignment, but there may be other ways of doing it (e.g., creating new bindings in an ML style).