Modern computers wouldn’t exist without the pioneering theories posited by Alan Turing, however the famed computer scientist was never quite able to make a working model of his hypothetical device.

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 computer science professor from Sweden has discovered an arbitrary code execution vulnerability in the Universal Turing Machine, one of the earliest computer designs in history. Pontus Johnson, a ...

For several years, [Jim] has wanted to construct a fully-mechanical universal Turing machine. Without the help of any electronic circuits or electrical input, his goal was to build the machine using ...

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

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

Firefox 1.0 is released. The name is a reference to the Red Panda, a “cat-bear” native to the eastern Himalayas and southwestern China. It shipped to over a million downloads on the first day, 10 ...

Read more: Click here to read a longer article regarding the Turing machine aspect of this story. A HUNDRED years after his birth, Alan Turing’s legacy comes in myriad guises. Last weekend, the ...

LONDON—Alan Turing (1912-54) is best known as one of the Bletchley Park codebreakers who hastened the Allied victory in World War II by cracking the German Enigma code. But when only 24 years old, he ...