Turing Machine Simulator

What is a Turing Machine?

A Turing machine consists of an infinite tape divided into cells, a read/write head that moves along the tape, a state register, and a transition table of rules.

At each step, the machine reads the symbol under the head, looks up the rule for (current state, symbol), writes a new symbol, moves left or right, and transitions to a new state.

Select a preset above or enter your own rules to get started. Click Step to advance one step at a time.