March 26th, 2010
Mike Davey writes:
In Alan Turing’s 1936 paper on computable numbers, he presented a thought experiment. Turing describes a machine that has an infinitely long tape upon which it writes, reads and alters symbols. He further shows that a machine with the correct minimal set of operations can calculate anything that is computable, no matter the complexity.
My goal in building this project was to create a machine that embodied the classic look and feel of the machine presented in Turing’s paper. I wanted to build a machine that would be immediately recognizable as a Turing machine to someone familiar with Turing’s work.
Possibly Related Posts:
- AntiKythera Mechanism out of Legos
- Visualizing wealth/mortality history in 4 minutes
- Tesla Turbine on steam
- Robotic Privacy Curtain
- MechaniCards