A field of computing concerned with what can be computed at all, how efficiently, and under what mathematical model, independent of any one machine or program that implements it. Belongs here: Algorithms and Complexity Theory, which classifies problems by the resources any solution must use, and Quantum Computing, which studies computation under a different physical model of information. Does not belong here: a concrete named algorithm or a built system, filed under the atlas's own algorithm or system types rather than under a field.
Facts
Comparison
Era of Emergence Theory Of Computation
Sources
1. Wikipedia: Turing machine
WikipediaTuring machine, lead section, field subcategory useQuote, Turing machine, lead section, field subcategory use
The Turing machine was invented in 1936 by Alan Turing, who called it an "a-machine" (automatic machine).
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.