On numerous occasions during the Second World War, members of the German high command had reason to believe that the allies knew the contents of some of their most secret communications. Naturally, the Nazi leadership was most eager to locate and eliminate this dangerous leak. They were convinced that the problem was one of treachery. The one thing they did not suspect was the simple truth: the British were able to systematically decipher their secret codes. These codes were based on a special machine, the “Enigma,” which the German experts were convinced produced coded messages that were entirely secure. In fact, a young English mathematician, Alan Turing, had designed a special machine for the purpose of decoding messages enciphered using the Enigma. This is not the appropriate place to speculate on the extent to which the course of history might have been different without Turing’s ingenious device, but it can hardly be doubted that it played an extremely important role.
[1]
D E Knuth,et al.
Mathematics and Computer Science: Coping with Finiteness
,
1976,
Science.
[2]
Martin D. Davis,et al.
Computability and Unsolvability
,
1959,
McGraw-Hill Series in Information Processing and Computers.
[3]
Boris A. Trakhtenbrot,et al.
Algorithms and automatic computing machines
,
1963
.
[4]
Martin Davis,et al.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
,
2004
.
[5]
Marvin Minsky,et al.
Computation : finite and infinite machines
,
2016
.
[6]
Martin D. Davis.
Hilbert's Tenth Problem is Unsolvable
,
1973
.
[7]
G. Chaitin.
Randomness and Mathematical Proof
,
1975
.
[8]
Hao Wang,et al.
Games, Logic and Computers
,
1965
.
[9]
Martin Davis,et al.
Hilbert's 10th Problem
,
1973
.
[10]
Michael O. Rabin.
Complexity of computations
,
1977,
CACM.