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

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

The Busy Beaver Challenge, a notoriously difficult question in theoretical computer science, is now producing answers so ...

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

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

[Credit: Jeroen van den Bosand, Davy Landman] How do you mark the birthday of Alan Turing, the “Father of Computers”? You could make a Google Doodle, or you could ...

<B>Why did you think of this?</B> To some extent, I'm masochistic. Recently I've been working on a paper that involves TMs and I wrote a small simulator to check my solutions. I'm bored; therefore, we ...