Lab 11
Due Thursday before the test
Today turn in your Kruskal's code
Turing Machine
Construct a Turing Machine that computes the function
f(n) = n mod 3
In other words, for you non-math major:
It will halt successfully if the number is divisible by 3.
11 (good)
1001 (good)
1101 (bad)
There's a pattern you can figure out to set up your states.