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

One of the things we love best about the articles we publish on Hackaday is the dynamic that can develop between the hacker and the readers. At its best, the comment section of an article can be a ...

For something that has been around since the 1930s and is so foundational to computer science, you’d think that the Turing machine, an abstraction for mechanical computation, would be easily ...

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

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

With regard to my previous blog on a One-bit processor and a mega-cool Turing machine, I’ve been bouncing around the Internet discovering all sorts of cool things… But before we hurl ourselves ...

This week we’ll venture in the realm of theory for a change, starting with Turing machines. In case some of you don’t know what a Turing machine is, here is the Wikipedia definition: “A theoretical ...

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