A Modernized Turing Machine
Capital of Nasty, an Electronic Magazine - ISSN 1482-0471
Friday, April 16, 2010 at 13:00 (3471/9)
Categories:
Computers, Technology
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.
Please enter your comment below. Hit Return twice (leaving a completely blank line) between paragraphs.
Use [b] for bold [/b] and [i] for italic [/i]. All other HTML commands will be stripped.
Your comment is (almost) immediately placed online as soon as you hit 'Post'.
Specifying an email address is optional. In the interests of your own privacy, CoN discourages you from doing so. Further, think twice about revealing any other personal information including telephone number, real name, exact address or blood type.
* A red asterisk denotes a required field.