Turing Machine States

This animation compares two definitions of a Turing machine side-by-side to show that a one-state machine is invalid under the textbook definition (which requires distinct accept and reject states) but valid under the slides definition (which accepts any input instantly).