Turing Machine (Binary incrementer)

What this is? A self‑contained, browser‑only demo of a one‑tape deterministic Turing Machine that computes n → n+1 on unsigned binary. The ARC section reports Answer • Reason • Check.

States: S0, S1, HALT    Symbols: 0, 1, _    Moves: L, R, N

S0: scan right to the first blank, then step left and switch to S1
  (S0, 0) -> (0, R, S0)
  (S0, 1) -> (1, R, S0)
  (S0, _) -> (_, L, S1)

S1: add 1 with carry (to the left)
  (S1, 0) -> (1, N, HALT)    ; found 0 → write 1 and halt
  (S1, 1) -> (0, L, S1)      ; carry: flip 1→0 and keep going left
  (S1, _) -> (1, N, HALT)    ; overflow (all 1s) → write leading 1 and halt

A1: 101001 → 101010
A2: 101111 → 110000
A3: 111111 → 1000000
A4: []     → [1]