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

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

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

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.

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

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

A 20-year-old UK undergrad proved it:<BR><BR>http://www.wolframscience.com/prizes/tm23/solved.html<BR><BR>http://blog.wolfram.com/2007/10/the_prize_is_won_the ...

"The Imitation Game" helped make World War II code breaker Alan Turing a household name. But for all the attention he has gotten for breaking Nazi Germany's Enigma code, the British mathematician ...

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