Egor Urvanov

Alan Turing

Formal verification · the Turing machine, 1936

A British mathematician (1912–1954), one of the founders of the theory of computation. In his 1936 paper “On Computable Numbers” he described the Turing machine, the simplest model of any program: a tape of cells and a head that reads, writes and moves by rules. In the same work he showed that some questions about programs cannot be answered by any program; the halting problem follows, and Rice’s theorem follows from that.

1011_01……headrule: read 1 → write 0, step righta tape of cellsAlan Turing, 1936: a model of any program● model, people, systems, data  ● agent and harnessA Turing machine: a tape of cells and a head that reads, writes and moves by rules

Source: Wikipedia: Alan Turing

Where it appears · 2

Related terms

Whole glossary

© 2026 Egor Urvanov