Turing Machine
Tape, head, states, transitions — the universal model of computation
Increment Binary
Palindrome Check
Copy String
Unary Add
State: q0 | Step: 0
Transition table (state, read → write, move, newState):
Each row: current_state, read_symbol → write_symbol, direction (L/R), next_state. HALT = halt state.