## Hunting for Turing Machines at the Wolfram Science Summer School

This year is the 100th birthday of Alan Turing, so at the 2012 Wolfram Science Summer School we decided to turn a group of 40 unassuming nerds into ferocious hunters. No, we didn't teach our geeks to take down big game. These are laptop warriors. And their prey? Turing machines!
In this blog post, I'm going to teach you to be a fellow hunter-gatherer in the computational universe. Your mission, should you choose to accept it, is to FIND YOUR FAVORITE TURING MACHINE.
First, I'll show you how a Turing machine works, using pretty pictures that even my grandmother could understand. Then I'll show you some of the awesome Turing machines that our summer school students found using

*Mathematica*. And I'll describe how I did an über-search through 373 million Turing machines using my Linux server back home, and had it send me email whenever it found an interesting one, for two weeks straight. I'll keep the code to a minimum here, but you can find it all in the attached*Mathematica*notebook. Excited? Primed for the hunt? Let me break it down for you. The rules of Turing machines are actually super simple. There's a row of cells called the*tape*: