In article <36655@iuvax.cs.indiana.edu> harlan@silver.ucs.indiana.edu (Pete Harlan) writes: >concludes with a lovely set of exercises that has the student >implement Turing machines as a controller driven by an external >state-transition table. One could hardly imagine a more fitting >conclusion for a chapter on mutation! Humm. Turing machines are pretty boring, IMHO.