Google Doodle Celebrating the Pioneer in Computer

[Aelon]

Here is a step by step solution:

Alan Turing Google Doodle Tutorial

Goal: make the number on the tape, be the same as the number on the memory above it using the rules .

How? The machine starts reading the rules from the left. Each step it moves 1 rule to the right, read that rules and performs it on the reading position . The yellow rules are editable. Edit them to create a program that will complete the task. Complete the task 5 times and you win the game (look at Google logo to keep track of your progress).

Rules:

Move left / right : move tape right/left.

Write 0 / 1 : changes the number on the reading position to 0 or 1.

If : changes direction if the number on the reading position is the same as the noted number (on this case, 1).

Loop : moves the tape N rules (it shows the destination ).

This is the last one about to be completed. Something wonderful happens next.

Explanation:

And for those who might not know, the machine is an example of a Turing machine, whence the relevance. The state of the Turing machine, in the language of the Wikipedia article, corresponds to the "active position" in the rules grid.

The binary patterns the puzzle wants you to make are 01011, 00011, 00011, 01011, 01001, 10000. These spell out 'GOOGLE' in the ITA2 code.

This was the character encoding used, among other places, in the Lorenz cipher machines, used for high-level communication in the WWII German military. (The more famous enigma was mostly used by units in the field, where equipment portability was more important.) A clever method devised by Turing, would allow these to be deciphered, and ultimately, Hitler to be defeated.