A Keep Put Turing Machine (SPTM) is a specialised sort of Turing machine that’s restricted to creating just one transfer in any given path earlier than halting and getting into a non-halting state. This restriction forces the SPTM to fastidiously contemplate its subsequent transfer, because it can not merely transfer forwards and backwards between two states to carry out a computation. SPTMs are sometimes utilized in theoretical pc science to review the bounds of computation, and so they have been proven to be able to simulating every other sort of Turing machine.
One of the vital essential advantages of SPTMs is their simplicity. As a result of they’re restricted to creating just one transfer in any given path, they’re much simpler to research than extra common sorts of Turing machines. This simplicity has made SPTMs a well-liked device for learning the theoretical foundations of pc science.
