From books

An imaginary, extremely simple machine that reads and writes symbols on an infinite tape can, in principle, compute anything any other computing machine ever could.

A simple Turing machine can compute anything any other computer ever could.

Turing imagined a long tape divided into boxes, where a simple machine reads a symbol, decides what to do using fixed rules, then moves left or right. However simple it looks, this Turing machine can, in theory, run any program that today's most powerful supercomputer can run.

Why it mattersHis idea laid the theoretical foundation for every computer and phone in use today.

Infinite tapeSimple rulesUniversalcomputation
From simple to total computing power.

Back to the feed