Thirteen Turing Machines in about 30 minutes.
1. Multiply a binary number by 4
2. Floor divide a binary number by 4
3. Increment an unsigned binary number
4. Negate a twos complement binary number
5. Output "HELLO"
6. Is a signed binary number negative?
7. Is a binary number all zeros?
8. Does a string have exactly three zeros?
9. Does a string NOT contain three consecutive zeros?
10. Is a binary number divisible by 3?
11. Is a string a palindrome over {a,b}*
12. {a^(2ⁿ) | n ≥ 0}
13. {aⁿbⁿ | n ≥ 0}
