Bletchley Park

With the help of Poland, Bletchley Park 'Ultra' became possible. In August 1939, the Poles handed out a copy of Enigma to Breguette Park. Without it, breaking the code is almost impossible. In January 1940, Alan Turing confirmed that the Polish misunderstood the operation of the mystery and realized that he was right after they met them. Then he managed to decipher the "green" code somehow. In February 1940, John Herivel thought of putting himself in the heart of the operator to reduce the possibility of setup.

Early in the Second World War, Turing worked at the headquarters of British code company Bletchley Park. In addition to mathematicians, Bletchley Park recruited linguists and chess champions and attracted talent through a complicated crossword tournament winner held in contact with Daily Telegraph. The mathematical and logical skills of Turing made him a natural cryptographer. Cryptographers write encryption systems, cryptologists study them, but cryptologists like Turing broke them. In 1939, Turing discovered the ENIGMA setting and created a method called "bomb" that allows the Allies to decrypt German encryption. Turing and his colleagues were also able to break the more complex navy ENIGMA system, helping the Allies avoid German U boats during the Atlantic campaign from 1941 to 1943.

On September 4, 1939, the day after France and the UK declared a war with Germany, Turing moved from Cambridge to British Government Code and British Lee Park at the headquarters of Cipher School (GC & CS). So, he became the chief designer of the code breaker Bombe used to decode the code of the Enigma cipher in Germany. In many respects, Bombe can be regarded as the first implementation of machine learning. Bombe is a machine that contains elements duplicating several copies of Enigma built to discover keys that can unlock German encoded messages. Find a candidate key (that is, a heuristic represented by a Bombe specific setting) that can resolve a set of constraints using heuristic search. Next, the human operator checks whether the key is applied to the encoded message. Turing later speculated that "intelligent activities mainly include various searches."