1 1 2 - 1
1 - 0 E 0
2 1 1 - 1
2 - 0 O 0
0

A parity-checker.
When given as input a string of n 1s, it will output O or E depending
on whether n is odd or even. 

The first Turing machine example for the Theoretical Computer Science
lectures, February 2009.

Antony Galton
21/1/09