| | Inventing computer science is not the same as inventing the computer. The invention of the computer—that is, a device that can automatically process data algorithmically, goes back to the non-electronic "analytical engine" devised (but never actually built) by [[Charles Babbage]] and [[Ada Lovelace]]. Actual electronic computers were invented by John Atanasoff in the 1930s and J. Presper Eckert and John Mauchly in the 1940s, among others. Alan Turing was associated with one of the early engineering efforts in the 1940s to make practical computers, the "ACE" (Automatic Computing Engine) project at the UK's National Physical Laboratory, but it was bested by the ENIAC, EDSAC, and EDVAC projects elsewhere. | | Inventing computer science is not the same as inventing the computer. The invention of the computer—that is, a device that can automatically process data algorithmically, goes back to the non-electronic "analytical engine" devised (but never actually built) by [[Charles Babbage]] and [[Ada Lovelace]]. Actual electronic computers were invented by John Atanasoff in the 1930s and J. Presper Eckert and John Mauchly in the 1940s, among others. Alan Turing was associated with one of the early engineering efforts in the 1940s to make practical computers, the "ACE" (Automatic Computing Engine) project at the UK's National Physical Laboratory, but it was bested by the ENIAC, EDSAC, and EDVAC projects elsewhere. |
| − | Alan Turing's worked in the field of [[Computer science]]. He took the concepts of mathematical logic and recursive function theory, from such people and Alonzo Church and [[Kurt Gödel ]], and showed that a certain type of automatic computing device, called a [[Turing machine]], was deeply connected to those concepts. His major paper on the subject was the 1937 paper ''On Computable Numbers, with an Application to the Entscheidungsproblem'', in the Proceedings of the London Mathematical Society. ("Entscheidungsproblem" is a German word for "decision problem", a term that logicians were using.) The concepts of [[Undecidable|Decidability]], the [[Halting problem]], and the [[Turing machine]], all staples of college-level computer science, originated with him. | + | Alan Turing's worked in the field of [[Computer science]]. He took the concepts of mathematical logic and recursive function theory, from such people and Alonzo Church and [[Kurt Gödel ]], and showed that a certain type of automatic computing device, called a [[Turing machine]], was deeply connected to those concepts. His major paper on the subject was the 1937 paper ''On Computable Numbers, with an Application to the Entscheidungsproblem'',<ref>https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/plms/s2-42.1.230</ref> in the Proceedings of the London Mathematical Society. ("Entscheidungsproblem" is a German word for "decision problem", a term that logicians were using.) The concepts of [[Undecidable|Decidability]], the [[Halting problem]], and the [[Turing machine]], all staples of college-level computer science, originated with him. |
| | Turing is also known for his contributions to the Allied war effort in [[World War II]] with the work of breaking the Nazi [[Enigma]] codes. He formulated the "[[Turing Test]]" as a criterion for determining whether a computer can actually exhibit humanlike intelligence. | | Turing is also known for his contributions to the Allied war effort in [[World War II]] with the work of breaking the Nazi [[Enigma]] codes. He formulated the "[[Turing Test]]" as a criterion for determining whether a computer can actually exhibit humanlike intelligence. |