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

Enigma machine

Can you keep a secret that changes every time you whisper it?

History of mathematics

Did you know a machine can mimic any calculation?

Alan Turing

Can a computer solve every problem?

Glossary of computer science

Ever wondered how computers organize data efficiently?

History of thermodynamics

Did you know a concept can predict chaos in a simple system?

History of the Hindu–Arabic numeral system

Why did ancient scholars invent a new way to count?

Swipe through more Discover concepts

Open Pocket Polymath