scroll to top
Stuck on your essay?
Get ideas from this essay and see how your work stacks up
Word Count: 413
A Turing machine is a hypothetical machine thought of by the mathematician Alan Turing in 1936 Despite its simplicity the machine can simulate any computer algorithm ATuring machineis a hypothetical device that manipulates symbols on a strip of tape according to a table of rules Despite its simplicityFirst of all a Turing machine processes an infinite tape This tape is divided into squares any square of which may contain a symbol from a finite alphabet with the restriction that there can be only finitely many non-blank squares on the tape The Turing machine mathematically models a machine that mechanically operates on a tape On this tape are symbols which the machine can read and write one at a time using a tape head Essentially a finite state machine consists of a number of states When a symbol a character from some alphabet say is input to the machine it changes state in such a way that the next state depends only on the current state and the input symbol You can represent a finite state machine in a form that makes it easier to understand and think about All you have to do is draw a circle for every state and arrows that show which state follows for each input symbol A Turing machine is a finite state machine that has an unlimited supply of paper tape that it can write on and read back There are many formulations of a Turing machine but essentially the machine reads a symbol from the tape which is used as an input to the finite state machine This takes the input symbol and according to it and the current state can perform three very basic operations it prints something on the tape then moves the tape right or left by one cell after that changes to a new state The function of the head contained a finite number of states corresponding to programmed and inputted instructions Any finite
@Kibin is a lifesaver for my essay right now!!
- Sandra Slivka, student @ UC Berkeley
Wow, this is the best essay help I've ever received!
- Camvu Pham, student @ U of M
If I'd known about @Kibin in college, I would have gotten much more sleep
- Jen Soust, alumni @ UCLA