Turing Machine Explorer

KiwiBee’s Turing Machine Explorer turns every instruction into a visible read, write, movement and next-state decision. Edit a validated binary input, load binary increment or an even-parity test, and trace the highlighted transition one step at a time. The current tape, head position, state, step count and halt condition remain visible. Inspired by Andy Li’s BSD-3-Clause-licensed visualization; KiwiBee implements its own explicit transition interpreter. It represents an abstract computational model, rather than real computer hardware.

• Step through binary increment and predict each highlighted transition.
• Change 1011 to 1111 to investigate a carry that extends the tape.
• Select the parity program and compare inputs with an odd and even number of 1s.

1. 1Trace an algorithm using states, symbols and transition rules.
2. 2Explain the roles of the tape, head, state and halt condition.

Questions fréquentes des enseignants