Turing machines

Theoretical computing models

A Turing machine is a theoretical computing device that manipulates symbols on a tape according to a set of rules.

Conceived by mathematician Alan Turing in 1936, it provides a formal model for computation and algorithmic processes.

Despite its simplicity—a read/write head, an infinite tape, and a table of instructions—a Turing machine can simulate any computer algorithm.

The concept is foundational to computer science, used to define what problems are computable in principle: The halting problem proves that no Turing machine can determine whether an arbitrary program will finish running.

computability

decidability

Algorithmic resolution capability

formalism

tape

Adhesive strip on roll

  • headUppermost body part
  • stateCondition or mode
  • symbolRepresentational mark or sign

alphabet · read-write · cell · configuration · deterministic · non-deterministic · output · step · computation · encoding

inventor

mathematician

Professional in abstract quantities

cryptanalysis · Cambridge · Princeton · WWII · artificial intelligence · philosophy of mind · 1936 · biography · The Imitation Game

logic

proof

Demonstration of truth

  • theoremDemonstrated logical conclusion
  • axiomSelf-evident starting principle
  • predicateSentence's non-subject portion

deduction · inference · propositional · validity · contradiction · tautology · completeness · soundness · symbolic logic · quantifier

variants

read-only

Viewable but not changeable

Opposites
abstraction vs. physical implementation

Turing machinessilicon chips

Etched semiconductor components

CPUs · digital computers · analog computers · ENIAC · embedded systems

computational paradigm

Turing machinesquantum computers

Processors using subatomic physics

neural networks · parallel computing · human cognition · wetware

Family

machine, Turing, Turing machine, Turing test

Familiarity
Top 500,000
Profile
Used worldwide · Timeless · Rated G