Almost missed it.

Today, in 1936, Turing submitted his paper “On Computable Numbers“, which postulated the Turing Machine, “devices capable of performing any conceivable mathematical problem once it was represented as an algorithm”, i.e. the grand-daddy of all your cool gadgets.

If an a-machine prints two kinds of symbols, of which the first kind (called figures) consists entirely of 0 and 1 (the others being called symbols of the second kind), then the machine will be called a computing machine. If the machine is supplied with a blank tape and set in motion, starting from the correct initial m-configuration, the subsequence of the symbols printed by it which are of the first kind will be called the sequence computed by the machine. The real number whose expression as a binary decimal is obtained by prefacing this sequence by a decimal point is called the number computed by the machine.

Get shitted in celebration, it’s the only way.