A mathematical model of computation. 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 1950, Alan Turing had an answer to that question—a computer was capable of “thought” if its output was so convincing that a person interacting with it couldn ’ t distinguish its answers from those ...

Forbes contributors publish independent expert analyses and insights. Gil Press writes about technology, entrepreneurs and innovation. The first Turing Test (a.k.a Loebner Prize Competition) is held ...

[Credit: Jeroen van den Bosand, Davy Landman] How do you mark the birthday of Alan Turing, the “Father of Computers”? You could make a Google Doodle, or you could ...

Alex Smith, a 20-year-old British engineering student, has proved that a Turing machine proposed by complexity guru Stephen Wolfram is in fact the simplest possible computer capable of solving every ...

On Saturday, British mathematician Alan Turing would have turned 100 years old. It is barely fathomable to think that none of the computing power surrounding us today was around when he was born. But ...

The Church-Turing limit restricts all current computation, including quantum computers, to rational number computation. This is because quantum computer designs (still not scalable even with high ...