Turing Machine Research Paper

784 Words4 Pages

Computers are very sophisticated machines today. They are still developing. But there is a first machine that well designed and easy to explain in computer world like every machine has its history. It has interesting structure unlike we know. Basic computers designed by mathematicians. Because there was no one who is computer engineer. So computers are used for computation of very simple tasks. In fact they have created abstract structure of computer task to help research the extent and restrictions of what can be computed. These abstract machines are named as "finite state machine". A finite state machine is a mathematical abstraction used to design algorithms. And the most popular finite state machine is "Turing machine". "Turing machine …show more content…

And we have implemented a basic Turing machine with some electronic parts like band and head as we have seen. But before implementation, formal analysis is necessary. We need to define Turing machine in more mathematical terms. Formally a machine might be defined to consist of; “A finite set of states with a distinguished start state, A finite set of symbols ” Barker-Plummer, David (2013). The machine need computation state for every execution. A computation states describe execution at given time. At any given step of the execution; “ a member of is the state that the Turing machine is in, a function from the integers into Σ describes the contents of each of the cells of the tape, a natural number is the index of the cell being scanned” Barker-Plummer, David (2013). Also we have used transition rules before. Every transition rule is a function which changer the status of the machine. “ agrees with everywhere except on (and perhaps there too), If < σS(hS)> != then = otherwise, |-| s structure changes then its mathematical formula changes. So there are a number of variations to the formulation that turn out to be equivalent to this one. And there are a lot of model of Turing machine. These are following ; “Two-way infinite tape Turing machine, multitape Turing machine, nondeterministic Turing machine, multidimensional Turing machine, multihead Turing machine, off-line Turing machine” John E. Hopcroft

More about Turing Machine Research Paper

Open Document