Practical computers don’t quite follow the design of a Turing Machine, but if we are prepared to sacrifice its need for an infinitely long paper tape it’s quite possible to build one.

We covered the original TMD-1 back in late summer, the idea of which was to serve as a physical embodiment of the Turing machine concept. Briefly, the TMD-1 represented the key “tape and head ...

Named after English scientist Alan Turing, a Turing machine is a finite state machine that reads a tape divided into cells. The Turing machine examines the symbol in each cell and based on the ...