A proof made public today illustrates that Stephen Wolfram's 2,3 Turing machine number 596440 is a universal Turing machine, and it has netted a University of Birmingham undergraduate $25,000. In 1936 ...

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 ...

A theoretical computer built in a mixed-up mathematical universe might not sound like the most practical invention. But the discovery shows that computation can turn up in the most unlikely places, ...

If we go way back to the 18th century, we find ourselves in the heyday of mechanics. Indeed, many physicists believed that the world was essentially mechanical and deterministic. More importantly, ...

Turing machines are widely believed to be universal, in the sense that any computation done by any system can also be done by a Turing machine. In a new article, researchers present their work ...

The recent movie “The Imitation Game” gave [Alan Turing] some well-deserved fame among non-computer types (although the historical accuracy of that movie is poor, at best; there have been several ...

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 ...

IN 1935, Alan Turing set out to build a reputation by outflanking the world’s leading mathematician. Turing was 22 years old, and a new fellow at Cambridge. His target, David Hilbert, was the ...