Alan M. Turing made certain significant contributions to computer science. However, their importance and impact is often greatly exaggerated, at the expense of the field's pioneers. See references in the 2021 report, "Turing Oversold. It's not Turing's fault, though" https://people.idsia.ch/~juergen/turing-oversold.html
TL;DR:
Some have suggested that Turing founded computer science or at least artificial intelligence (AI) [BEA], invented the computer [IMI][HAI14], showed the undecidability of the halting problem [HLT21], single-handedly created the method that broke the Nazi code in WWII [IMI][NASC6-7], or invented the "Turing test" [TUR3a].
None of these claims is compatible with the historical facts, and Turing himself did not claim any of this during his life.
Computer science dates back at least to Leibniz (1600s), the so-called "first computer scientist" [LA14], who built on even earlier work since the first programmable machine by Heron of Alexandria in the 1st century B.C. [SHA7a][RAU1]. Leibniz described the first machine to perform all four arithmetic operations, the first with a memory [BL16], and principles of binary computers (1679)[L79][LA14][HO66][L03][LEI21,a,b] employed by virtually all modern machines; his formal Algebra of Thought (1686) [L86][WI48][LEI21,a,b] is deductively equivalent [LE18] to the Boolean Algebra (1847) [BOO].
The first 20th century pioneer of practical AI was not Turing but Quevedo: his 1914 chess end game player was still considered remarkable decades later at the 1951 Paris AI conference [BRU1-4][BRO21].
The theory of AI and computer science was not founded by Turing but by Gödel (1931-34) [GOD][GOD34] who identified the fundamental limits of algorithmic theorem proving, computing, and any type of computation-based AI [GOD][BIB3], as well as computer science's most famous open problem "P=NP?"[GOD56][URQ10] (there is a reason why there is a Gödel Prize for theoretical computer science).
Gödel's 1931 work was extended by Church, whose 1935 result [CHU] on the decision problem preceded Turing's identical 1936 result [TUR].
Turing's 1936 paper [TUR] was claimed to provide the "theoretical backbone" for all computers to come [NASC7]. However, it just described a simple theoretical and impractical pen & paper construct like those of Gödel (1931-34) [GOD][GOD34], Church (1935) [CHU], and Post (1936) [POS], which did not even feature elementary practical building blocks such as addressable memory.
It was actually Zuse's 1936 patent application [ZU36] which really described what became the first practical general-purpose program-controlled computer (completed in 1941) [ZUS21,a,b][RO98].
Unlike Church (1935) [CHU], Turing (1936) did not even consider halting programs [TUR]; the famous halting problem (often attributed to him) was actually named by Davis in 1958 [HLT58] and formulated by Kleene in 1952 [HLT52][HLT21].
The Colossus special purpose computer of WWII [NASC6-7] was designed by Flowers, not by Turing.
The core of the Enigma code-breaking algorithm was not due to Turing either (as sometimes suggested [IMI]) but to Polish mathematicians Rejewski, Rozycki and Zygalski.
The famous so-called "Turing Test" was actually prefigured by Descartes [TUR3,a,b].
On the other hand, Turing did publish pioneering work, e.g., in bioinformatics [TUR2]. It seems unlikely that the great scientist he was would ever approve of the overblown claims about him so easily dismissing the work of his colleagues.
All references in the report above. Happy Birthday to Alan Turing!
















