A Modernized Turing Machine

#Computers

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.

  489

 

You may also be interested in:

"Even primitive quantum processors of only a few qubits can perform important computations."
Open Source Makes Big Gains at the London Stock Exchange
NEVER COMMENT LIKE THIS ON GOOGLE AGAIN
8086tiny: the Smallest, Free, Open-Source PC XT-Compatible Emulator
The New MacBook Air Is Good Enough to be Your Main Computer