Classical Models of Computation
Review of the Turing Machine and the circuit model of classical computation
Last updated
Review of the Turing Machine and the circuit model of classical computation
Last updated
The Turing machine is a theoretical computer, originally proposed by Allan Turing. It can compute anything that is possible on a classical system.
It includes a finite state machine, a machine which has a finite number of possible states, and whose current state relies on the previous state. So if I put in the number 4 now, and the number 4 again next, the results may be different because the current answer depends on the previous result and well as my input.
It's also a tape machine. It has an infinite rope of tape that it can read from or write on, but the important thing about the tape is that it can only input one instruction at a time. Because the machine includes a finite state machine, the state changes every time a new instruction is read in (Kaye, P - p. 3).
The Turing machine is the most abstract idea of a computer. We never talk about storage, or time, or wires - only instructions and state. We'll move a bit closer to real life in our discussion of the circuit model of computation.
In the circuit model we have a given number of wires, along which travels a current. As we talked about earlier high voltage corresponds to 1 and low voltage corresponds to 0. Along the path of this wire is some kind of logic gate which affects some change of state on the system (Kaye, P - p. 3):
A logic gate is an operator that transforms the input into some output. These may preform fundamental boolean operations or more complex instructions.
For example, the transformation matrix for a NOT gate looks like this:
Let's do an example. We'll start by defining the matrices for our classical bits:
Looks familiar I'm sure. We'll multiply the 0 vector by the NOT transformation matrix:
You can see that the result is the 1 matrix.
Classical gates are flexible. We can take multiple bits as input, and we can produce multiple bits as output. We can combine them and use them to construct larger and more complex operations.
We can also define universal gates - gates which can be used to define all other gate operations. For example the NAND gate (NOT/AND) is an example of a universal gate.
During this entire tutorial, we've focused heavily on information.
How is information represented? How is information processed? How is information preserved? How is information changed?
We can see that in both these models of computation, information can be destroyed. The original state of the wire may not be retrievable after certain gate operations. We've gained something, but we've also lost something.
Quantum mechanics doesn't allow for this possibility. All information must be preserved. This means all of our quantum operations must be reversible.
You see here on the left a series of inputs, labelled . On the right we have a series of outputs labelled . In the middle we have a few gates, labelled . Some of the gates take in multiple outputs, and produce multiple outputs.
