The deification of Alan Turing
Very slanted article. Turing was hardly unknown to logicians. In fact, even though the undecidability in lambda calculus  was proven by Church in 1936 [1], Godel remained unconvinced that it was a complete model of mechanical computation.<p>It was Turing&#x27;s paper, in which, among many other things, he showed that Turing machines were equivalent to lambda calculus, that convinced Godel that both Turing machines, and hence lambda calculus, were the right models of mechanical computation.<p>This was circa 1936, before Turing came to Princeton. So he was hardly unknown to mathematicians even then.<p>The Turing test and his codebreaking work are of course, well known. Of course, there are other achievements of Turing including a powerful version of the central limit theorem [2] , and &quot;the chemical basis of morphogenesis&quot; [3], to show that he was hardly incapable or obscure. Turing was an original genius, with a wide variety of original views that were later found to be far-reaching.<p>[1] <a href="https:&#x2F;&#x2F;www.jstor.org&#x2F;stable&#x2F;2371045?origin=crossref&amp;seq=1#metadata_info_tab_contents" rel="nofollow">https:&#x2F;&#x2F;www.jstor.org&#x2F;stable&#x2F;2371045?origin=crossref&amp;seq=1#m...</a><p>[2] <a href="https:&#x2F;&#x2F;www.jstor.org&#x2F;stable&#x2F;2974762?seq=1#metadata_info_tab_contents" rel="nofollow">https:&#x2F;&#x2F;www.jstor.org&#x2F;stable&#x2F;2974762?seq=1#metadata_info_tab...</a><p>[3] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;The_Chemical_Basis_of_Morphogenesis" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;The_Chemical_Basis_of_Morphoge...</a>