Author

Alan Turing

1 reading card from 1 book · 1936.

ShelvesIT security Artificial intelligenceBooksOn Computable Numbers, with an Application to the Entscheidungsproblem 1936

Shelf

1 card

01
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.
On Computable Numbers, with an Application to the Entscheidungsproblem · 1936
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.
Open the card →