A Modernized Turing Machine


Fri, Apr 16th, 2010 13:00 by capnasty NEWS

In a paper on computable numbers of 1936, Alan Turing presented a thought experiment describing a machine that, with an infinitely long tape it writes, reads and alters symbols. He postulated that this machine, with the correct minimal set of operations, could calculate anything that is computable, no matter the complexity. Trivial as it might look today, it was ground-breaking for the concepts it unveiled at its time, inspiring Mike Darvey to build his own with a few modern touches.



You may also be interested in:

Pixelated Fireplace
Moonjs: the Apollo Guidance Computer Simulated in Javascript
Speech Synthesizer in 1k of Javascript
Happy Birthday: the Personal Computer Turns 30
Shit That Siri Says