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

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

Alan Turing theorized a machine that could do infinite calculations from an infinite amount of data that computes based on a set of rules. It starts with an input, transforms the data and outputs an ...

The British mathematician and pioneer of computing Alan Turing published a paper in 1936 which described a Universal Machine, a theoretical model of a computer processor that would later become known ...

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

Turing machines are widely believed to be universal, in the sense that any computation done by any system can also be done by a Turing machine. In a new article, researchers present their work ...

Vice reports that scientists have created the first known “chemical Turing machine,” meaning a liquid that can do the calculations that define a classic computer science standard. Juan Pérez-Mercader ...