Live briefing
Everything about Turing machine
Computation model defining an abstract machine
A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Turing machineA 5-minute orientation
- Skim a recent paper: Air quality particulate-pollution prediction applying GAN network and the Neural Turing MachineInfluential work since 2022
- Pick up a classic book: The pattern on the stoneThe most-reprinted book on the subject
- Read the landmark paper: One-tape, off-line Turing machine computationsCited 166 times
- Go sideways: Post–Turing machineA closely related topic
- Go sideways: Universal Turing machineA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
One-tape, off-line Turing machine computations
A Turing machine time hierarchy
Beyond the universal Turing machine
On-Line Turing Machine Computations
Computer Studies of Turing Machine Problems
Tape-reversal bounded turing machine computations
The other Turing machine
What Turing Did after He Invented the Universal Turing Machine
🆕 Influential since 2022
Air quality particulate-pollution prediction applying GAN network and the Neural Turing Machine
Unraveling biochemical spatial patterns: Machine learning approaches to the inverse problem of stationary Turing patterns
Biomimetic Turing machine: A multiscale theoretical framework for the inverse design of target space curves
Why I am not a Turing machine
LMTTM-VMI: Linked Memory Token Turing Machine for 3D volumetric medical image classification
đź“š Books worth reading
The pattern on the stoneW. Daniel Hillis · 1998
Computational complexityOded Goldreich · 2008
The Universal Turing MachineRolf Herken · 1988
Turing's LegacyRod Downey · 2014- 📕AutomataV. David Hopkin, D Hookin · 1976
Turing Machine Universality of the Game of LifePaul Rendell · 2015- 📕Computability, 1973-1974Davis, Martin · 1974
- 📕The universal turing machineRolf Herken · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Post–Turing machine A Post machine or Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model…
- Universal Turing machine In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in…
- Church–Turing thesis In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Register machine In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines, analogous to a Turing machine and thus…
- Turing machine equivalents A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite…
- History of the Church–Turing thesis The history of the Church–Turing thesis ("thesis") involves the history of the development of the study of the nature of functions whose values are effectively…
- Algorithm characterizations Algorithm characterizations are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers are…