√2 Turing Machine – step-by-step simulator

A Turing Machine that computes the square root of 2 like the example in Ch. 6 of "The Annotated Turing" by Charles Petzold.📖

m-config. (tape head state): begin
Last Symbol Read: 0
Bits Computed of Sqrt(2) Thus Far: -
A Turing Machine Tape with Interleaved F-squares (final output bits) and E-squares (workspace)
x marker y marker z marker (= x & y coincide) r/s/t → 0 u/v/w → 1