The Power of One-State Turing Machines (2018)
## Computability<p>Turning Machines are a simple, purely hypothetical, machines that have allowed computer scientists&#x2F;mathematicians to conclude <i>very profound</i> properties of computation. Although they are mentioned with some frequency here, it&#x27;s not a subject that most of us have any training in.<p>I had the good fortune to study computer science while in college many years ago. There was a lot less to learn back then and I was introduced to the theory of computation at the undergraduate level.<p>For those that haven&#x27;t had the pleasure of problem sets covering Turing Machines but would like to learn something about them, I recommend the <i>Stanford Encyclopedia of Philosophy</i> entry on Turing machines [1]. It goes into more depth than Wikipedia while being very easy to understand.<p>Turing machines are extraordinarily simple, much simpler than any real computer. The fact that Turing Machines deserve an entry in a Philosophy reference is because of their power in elucidating the very nature of computation.<p>About 80+ years ago, it was discovered that the set of problems that can be solved&#x2F;computed by a Turing Machine is <i>exactly</i> the same set that can be solved with the Church&#x27;s Lambda Calculus, [2] and recursive functions as formalized by Gödel&#x27;s [3]. This, to me surprising, result led to the <i>Church-Turing</i> thesis: the hypothesis that any effectively computable (i.e. solvable through some mechanistic procedure) can be solved by a Turning Machine. From this we know, for example, that true algorithms don&#x27;t exist for a whole host of problems. This isn&#x27;t the same claim that some problems are hard and don&#x27;t have tractable exact solutions (e.g. the knapsack problem or the traveling salesman problem [4]); there are algorithms for these problems--they simply take a very long time. Some interesting problems on the other hand have no algorithm at all. This can be shown by demonstrating that no Turing Machine could be constructed to solve the problem (e.g. the halting problem [5]).<p>What about quantum computers? They look like an approach so different and so powerful that maybe they will provide a stronger model of computation than that limited by the bounds of Church-Turing. Unfortunately, the qubit based approaches that we are now pursuing have been demonstrated to be &quot;equivalent&quot; to classical (Turing) machines, just with different performance time&#x2F;space tradeoffs. So qubit based quantum computers may someday solve challenging, exponential time problems, but they won&#x27;t solve every problem.<p>## Turing machines<p>Turing&#x27;s insight was that any mechanical procedure for computation could be modeled by a simple machine, the Turing Machine. A Turing Machine has a &quot;tape&quot;, think of it as an infinite strip of paper divided into cells, like an infinite array: tape[k]. Each cell can hold a symbol from some finite alphabet.<p>There is a single read&#x2F;write head positioned at a location on the tape. The head can read a symbol from the location or erase&#x2F;write a symbol the location, and then it can move one location left or right.<p>Turing machines also have a state from some finite range of states, say 1...N. One state is designated as the initial state.<p>Finally, there is a state transition table in the Turing Machine that determines its operation. For each combination of (1) current state and (2) current symbol under the read&#x2F;write head, the transition table gives (a) the new internal state and (b) the symbol that should be written on the tape at the current location and (c) the direction the head should move--left or right.<p>When I first saw the definition of a Turing Machine, I thought that it looked unlike a computer. The state table seemed to encode the entire operation of the machine. It could potentially be a huge table of specific operations to solve some problem. Turing machines seemed to me to be special purpose constructions unlike the more flexible architectures of programmable computers. Indeed, we studied a number of different Turing Machines that would solve simple problems with inputs from the tape.<p>The big surprise for me was seeing a <i>Universal Turing Machine</i>. It turns out that there are Turing Machines, having a fixed reasonably small state transition table that can do anything that <i>any</i> other Turing Machine can do. These &quot;Universal&quot; machines use a program on the tape that provides the instructions to process the remaining input data from the tape.<p>The idea of a Turing Machine doesn&#x27;t rely on lots of states, a few is enough to construct a universal machine. Likewise, there are Universal machines that need a tape that extends in only one direction and tape vocabularies that have a very limited number of symbols.<p>[1] <a href="https:&#x2F;&#x2F;plato.stanford.edu&#x2F;entries&#x2F;turing-machine&#x2F;" rel="nofollow">https:&#x2F;&#x2F;plato.stanford.edu&#x2F;entries&#x2F;turing-machine&#x2F;</a><p>[2] <a href="https:&#x2F;&#x2F;plato.stanford.edu&#x2F;entries&#x2F;lambda-calculus&#x2F;" rel="nofollow">https:&#x2F;&#x2F;plato.stanford.edu&#x2F;entries&#x2F;lambda-calculus&#x2F;</a><p>[3] <a href="https:&#x2F;&#x2F;plato.stanford.edu&#x2F;entries&#x2F;recursive-functions&#x2F;" rel="nofollow">https:&#x2F;&#x2F;plato.stanford.edu&#x2F;entries&#x2F;recursive-functions&#x2F;</a><p>[4] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Travelling_salesman_problem" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Travelling_salesman_problem</a><p>[5] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Halting_problem" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Halting_problem</a>