Turing+Machine



The turing machine is defined as “an abstract model of a computing device, used in mathematical studies of computability. A Turing machine takes a tape with a string of symbols on it as an input, and can respond to a given symbol by changing its internal state, writing a new symbol on the tape, shifting the tape right or left to the next symbol, or halting. The inner state of the Turing machine is described by a finite state machine. It has been shown that if the answer to a computational problem can be computed in a finite amount of time, then there exists an abstract Turing machine that can compute it.”

Alan Turing made the Turing machine in 1936. Turing believed that if you wrote down rules for this machine to perform, it could make the calculations for it. This machine has paper tape pass through and a head that is programmed to write on the tape. Binary is used for this machine. It makes mathematical calculations. The machine is sometimes in different states and has a table of rules that makes the machine work and tells it what state to be in. In the Turing machine, there is the input and output, the machine itself, and a place where rules are made.


 * Sources**


 * []
 * []
 * http://dictionary.reference.com/browse/turing machine