Universal Turing machine

Alan Turing introduced the Turing machine in 1936

Alan Turing's seminal paper laid the foundation for theoretical computer science by introducing the concept of a Turing machine. This machine became a fundamental model for understanding what is and isn't computable.

Example

Turing machines can simulate any other Turing machine, demonstrating the universality of computation.

Remember this

Turing's work is crucial because it established the theoretical limits of computation and inspired the development of modern computers.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Alan Turing

Can a computer solve every problem?

Colossus computer

Colossus, 1943: first programmable computer to decrypt Nazi codes

History of the Hindu–Arabic numeral system

The word 'algorithm' originates from al-Khwarizmi, a 9th-century Persian mathematician

Maxwell's equations

Maxwell unified electricity, magnetism, and light into a single theory with four equations

Fax

Fax machine invented in 1843, 33 years before the telephone

Whitfield Diffie

Did you know there's a secret handshake for computers?

Swipe through 100 ML concepts daily

Open Pocket Polymath