# Alan Turing (1912-1954)

Alan Turing (1912-1954) was a person.

**Context:****Counter-Example(s):****See:**Computer Scientist, Theoretical Computer Scientist, Mathematician, Logician, Cryptanalyst, Turing Test, Turing Complete, Church-Turing Thesis.

## References

### 2011

- http://en.wikipedia.org/wiki/Alan_Turing
- QUOTE:
**Alan Mathison Turing**, OBE, FRS (11px /ˈtjʊərɪŋ/ Template:Respell; 23 June 1912 – 7 June 1954), was an English mathematician, logician, cryptanalyst, and computer scientist. He was highly influential in the development of computer science, providing a formalisation of the concepts of “algorithm” and "computation" with the Turing machine, which played a significant role in the creation of the modern computer.^{[1]}^{[2]}Turing is widely considered to be the father of computer science and artificial intelligence.^{[3]}He was stockily built, had a high-pitched voice, and was talkative, witty, and somewhat donnish.^{[4]}During the Second World War, Turing worked for the Government Code and Cypher School at Bletchley Park, Britain's codebreaking centre. For a time he was head of Hut 8, the section responsible for German naval cryptanalysis. He devised a number of techniques for breaking German ciphers, including the method of the bombe, an electromechanical machine that could find settings for the Enigma machine. After the war he worked at the National Physical Laboratory, where he created one of the first designs for a stored-program computer, the ACE.

- QUOTE:

- ↑ Template:Cite doi
- ↑ Cite error: Invalid
`<ref>`

tag; no text was provided for refs named`AFP`

- ↑ Homer, Steven and Alan L. (2001).
*Computability and Complexity Theory*. Springer via Google Books limited view. p. 35. ISBN 0-3879-5055-9. http://books.google.com/?id=r5kOgS1IB-8C&pg=PA35. Retrieved 13 May 2011. - ↑ Template:Citation

### 1950

- (Turing, 1950) ⇒ Alan M Turing. (1950). “Computing Machinery and Intelligence." Mind, 59.

### 1936

- (Turing, 1936) ⇒ Alan M. Turing. (1936). “On Computable Numbers, with an Application to the Entscheidungsproblem.” In: Proceedings of the London Mathematical Society, 2(42). doi:10.1112/plms/s2-42.1.230.