Turing Machine

The following sequence of frames shows the steps through the execution of the algorithm to add two "monadic" numbers. NOTE: During the running of the program the diagram highlights the instruction just executed and resulting machine configuration.

The algorithm that was used is:



Suggested problem: Given two characters on a tape from the set {a, b, c} with the read/write head set on the leftmost character, write a Turing Machine program to exchange the position of the two characters.



When you have completed these activities, you must move on to the Turing Machine emulator:

Last updated 2001/12/03
© J.A.N. Lee, 2000-2001.