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

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

The goal of the “busy beaver” game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics.

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

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

Whether or not you caught wind of the excited announcement that "Eugene Goostman," a computer program ("chatbot") devised by Vladimir Veselov, Eugene Demchenko and Sergey Ulasen, had passed the Turing ...