Anyway, for those of you having trouble, just pay attention to the symbols and remember the basic formulas for computer logic. A computer can do the following when it reaches a place:
Change that place to the opposite value (1 or 0)
Move ahead to the next place
Move back to the previous place
Change that place value IF it is a different value (1, 0 or empty). If it's not, move ahead or back.
Go To a designated spot in the program.
To solve any of the puzzles, just pay attention to what position the doodle will be working with (where have the arrows moved it to), what that position needs to be (it has to match the strip at the top), and what process will get it to match that value.
The code you need to match is 101. The code you've started with is 001. The machine will start from the beginning. Each time it makes a change, it starts back at the beginning.
You could set the machine so that it just flips the first two digits, but that won't work, because the first digit would get flipped to a one, then flipped back to a zero on its first time through. Instead, you want to set it so that if the first digit is 0, it becomes 1. If it's 1 or blank, the machine moves ahead to digit two. Same thing there.
Totally OT, I know, but it's June, and Turing deserves a moment of our time.