Step 1: A Turing Machine Can Be Simulated By Two Stacks.
A Turing machine consists of an FSM and an infinite tape, initially filled with zeros, upon which the machine can write ones and zeros. At any time, the read/write head of the machine points to one cell on the tape. This tape can be conceptually cut in half at that point. Each half of the tape can be treated as a stack, where the top is the cell nearest the read/write head, and the bottom is some distance away from the head, with all zeros on the tape beyond the bottom. Accordingly, a Turing machine can be simulated by an FSM plus two stacks. Moving the head left or right is equivalent to popping a bit from one stack and pushing it onto the other. Writing is equivalent to changing the bit before pushing it.
Read more about this topic: Counter Machine, Two-counter Machines Are Turing Equivalent (with A Caveat)
Famous quotes containing the words step, machine and/or simulated:
“Perestroika basically is creating material incentives for the individual. Some of the comrades deny that, but I can’t see it any other way. In that sense human nature kinda goes backwards. It’s a step backwards. You have to realize the people weren’t quite ready for a socialist production system.”
—Gus Hall (b. 1910)
“Psychiatric enlightenment has begun to debunk the superstition that to manage a machine you must become a machine, and that to raise masters of the machine you must mechanize the impulses of childhood.”
—Erik H. Erikson (1904–1994)
“Not too many years ago, a child’s experience was limited by how far he or she could ride a bicycle or by the physical boundaries that parents set. Today ... the real boundaries of a child’s life are set more by the number of available cable channels and videotapes, by the simulated reality of videogames, by the number of megabytes of memory in the home computer. Now kids can go anywhere, as long as they stay inside the electronic bubble.”
—Richard Louv (20th century)