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

File under: useless but awesome. A Turing Machine is a simple computer capable of simulating complex logarithms. You might remember the interactive doodle Google did of one a few months back for Alan ...

It is the height of the Second World War. A group of codebreakers stands in a dimly lit warehouse 50 miles northwest of London, a giant machine composed of spinning drums and wires looms in front of ...

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

In 1999’s The Matrix, life as we know it is actually a virtual reality abstraction; a collection of well-shaped zeroes and ones which add up to an utterly convincing simulation of the real world.

If you really know your Magic the Gather and you’re a programming wiz you’ll appreciate this paper on building a functioning Turing Machine from Magic the Gathering cards. We’re sure you’re familiar ...

As a practising computer scientist, I thought I had a fairly good grasp of Alan Turing’s many contributions to the field. But The Turing Guide, by Jack Copeland, Jonathan Bowen, Mark Sprevak and Robin ...

IN 1935, Alan Turing set out to build a reputation by outflanking the world’s leading mathematician. Turing was 22 years old, and a new fellow at Cambridge. His target, David Hilbert, was the ...

A mathematical model of computation. Named after English scientist Alan Turing, a Turing machine is a finite state machine that reads a tape divided into cells. The Turing machine examines the symbol ...