If Alan Turing were still alive today, he would have just turned 100-years-old. That's why Google's paying tribute to the pioneering computer genius with a Google Doodle that simulates the behaviour of a Turning machine.
Turing conceived of his famed machine in 1936, which in essence was a mechanical computer with what turing called "infinite memory." His machine would scan the tape, looking for specific cues (in the form of symbols) which would alter the state of the machine. Though capable of processing the logic of any computer algorithm, the Turing Machine is not seen as an actual solution for real-life computing. Rather, it has become a standard way to conceptualise the behaviour of CPUs.
Today's doodle challenges you to use the virtual Turing Machine to spell out Google in binary code. Are you up for the challenge? [Google]