I found a way to get an infinite loop on one of the puzzles, but it looks like the machine halts after a fixed number of iterations. Does this mean it doesn't meet the criteria necessary to be considered a Turing machine?
I'm just getting a static jpg; did they take it down?<p><a href="http://www.google.co.nz/logos/2012/turing-doodle-static.jpg" rel="nofollow">http://www.google.co.nz/logos/2012/turing-doodle-static.jpg</a>
Curious about what the final-final TM does:<p><pre><code> "1 . D1 . . . . _ R D_ B2"
"R U _ R D_ B2 . 1 B8 1 D_ L B2"
"U . B2 . 1 R 0 U_ L B2 0 B9"
</code></pre>
Was it just spitting binary words?<p>I am too lazy to redo the previous 12 TM again. If you get there, do not reload.