![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/0/03/Turing_Machine_Model_Davey_2012.jpg/640px-Turing_Machine_Model_Davey_2012.jpg&w=640&q=50)
Turing machine
abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules / From Wikipedia, the free encyclopedia
Turing machine is a term from computer science. A Turing machine is a system of rules, states and transitions rather than a real machine. It was first described in 1936 by English mathematician and computer scientist Alan Turing. There are two purposes for a Turing machine: deciding formal languages and solving mathematical functions. Turing machines are one of the most important formal models in the study of computer science.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/0/03/Turing_Machine_Model_Davey_2012.jpg/640px-Turing_Machine_Model_Davey_2012.jpg)