> it's time to drag out the Snit Dick-Swing-o-Meter!
>
> Step right up buoyz and take a swing at it. How high can you make it
> go!
>
> Kelley
>
> (who still wants to have an LOB party so all the LOB chixors can do
> the dick swing with big inflatable plastics dicks. Yeah, we'll to it
> to the Tootsieroll! Joanna, you can choreograph!)
Couldn't it be done just as well by a Turing machine?
> Conceptually, a Turing Machine has a finite set of states, a finite
> alphabet (that has a blank symbol), and a finite set of instructions.
> Physically, it has a head that can read, write, and move along an
> infinitely long tape that is divided into cells, where each cell has a
> value of blank or a letter in the Turing Machine's alphabet. An
> instruction is defined as a five tuple, like this:
>
> (starting state, starting value, new state, new value, movement)
>
> The starting state is the state the head is currently in. The starting
> value is the value of the cell the head is positioned at. The new
> state and new value replace the starting state and starting value,
> respectively. The movement specifies which direction the head moves by
> one cell. The head halts when it can not find an instruction for the
> current state or the current cell value. A Turing machine will start
> at the first non-blank cell.
>
> Usually, states are named s0, s1, s2, etc. The alphabet is usually
> 'B', for blank, and '1' and '0'. Numbers can (but not necessarily) be
> represented by a series of 1s with a length of n + 1 for a number n.
> (<http://www.nmia.com/~soki/turing/>)
Ted