Alan Turing
Alan Turing | |
---|---|
![]() Alan Turing memorial statue in Sackville Park | |
Born | Maida Vale, London, England | 23 June 1912
Died | 7 June 1954 | (aged 41)
Nationality | British |
Alma mater | University of Cambridge Princeton University |
Known for | Halting problem Turing machine Cryptanalysis of the Enigma Automatic Computing Engine Turing Award Turing Test |
Awards | Officer of the Order of the British Empire Fellow of the Royal Society |
Scientific career | |
Fields | Mathematician, logician, cryptanalyst |
Institutions | University of Manchester National Physical Laboratory University of Cambridge |
Doctoral advisor | Alonzo Church |
Doctoral students | Robin Gandy |
Alan Mathison Turing, OBE, FRS (Template:PronEng) (23 June 1912 – 7 June 1954) was a British mathematician, logician, cryptanalyst and computer scientist.
Turing is often considered to be the father of modern computer science. He provided an influential formalisation of the concept of the algorithm and computation with the Turing machine. For his role in the modern computer, the Time Magazine, in naming Turing one of the 100 most influential people of the 20th century, states: "The fact remains that everyone who taps at a keyboard, opening a spreadsheet or a word-processing program, is working on an incarnation of a Turing machine."[1]
With the Turing test, meanwhile, he made a significant and characteristically provocative contribution to the debate regarding artificial intelligence: whether it will ever be possible to say that a machine is conscious and can think. He later worked at the National Physical Laboratory, creating one of the first designs for a stored-program computer, the ACE, although it was never actually built in its full form. In 1948, he moved to the University of Manchester to work on the Manchester Mark 1, then emerging as one of the world's earliest true computers.
During the Second World War, Turing worked at Bletchley Park, Britain's codebreaking centre, and was for a time 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.
Near the end of his life Turing became interested in chemistry. He wrote a paper on the chemical basis of morphogenesis[2] and he predicted oscillating chemical reactions such as the Belousov–Zhabotinsky reaction, which were first observed in the 1960s.
Turing was homosexual, living in an era when homosexuality was considered a mental illness and homosexual acts were illegal. Subsequent to his being outed, he was criminally prosecuted, which essentially ended his career. He died not long after from what was officially declared self-induced cyanide poisoning, although his mother (and some others) considered the circumstances of his death to be ambiguous.
Childhood and youth
Alan Turing was conceived in Chhatrapur, Orissa, India.[3] His father, Julius Mathison Turing, was a member of the Indian Civil Service. Julius and wife Sara (née Stoney; 1881 – 1976, daughter of Edward Waller Stoney, chief engineer of the Madras Railways) wanted Alan to be brought up in England, so they returned to Maida Vale,[4] London, where Alan Turing was born on 23 June 1912, as recorded by a blue plaque on the outside of the building, now the Colonnade Hotel.[5][6] He had an elder brother, John. His father's civil service commission was still active, and during Turing's childhood years his parents travelled between Guildford, England and India, leaving their two sons to stay with friends in Hastings in England.[7] Very early in life, Turing showed signs of the genius he was to display more prominently later.[8]
His parents enrolled him at St Michael's, a day school, at the age of six. The headmistress recognised his talent early on, as did many of his subsequent educators. In 1926, at the age of 14, he went on to Sherborne School, a famous and expensive public school in Dorset. His first day of term coincided with the General Strike in Britain, but so determined was he to attend his first day that he rode his bicycle unaccompanied more than 60 miles (97 km) from Southampton to school, stopping overnight at an inn.[9]
![](http://upload.wikimedia.org/wikipedia/commons/thumb/f/fd/KingsCollegeChapel.jpg/220px-KingsCollegeChapel.jpg)
Turing's natural inclination toward mathematics and science did not earn him respect with some of the teachers at Sherborne, whose definition of education placed more emphasis on the classics. His headmaster wrote to his parents: "I hope he will not fall between two schools. If he is to stay at public school, he must aim at becoming educated. If he is to be solely a Scientific Specialist, he is wasting his time at a public school".[10]
Despite this, Turing continued to show remarkable ability in the studies he loved, solving advanced problems in 1927 without having even studied elementary calculus. In 1928, aged 16, Turing encountered Albert Einstein's work; not only did he grasp it, but he extrapolated Einstein's questioning of Newton's laws of motion from a text in which this was never made explicit.[11]
Turing's hopes and ambitions at school were raised by the close friendship he developed with a slightly older fellow student, Christopher Morcom, who was Turing's first love interest. Morcom died suddenly only a few weeks into their last term at Sherborne, from complications of bovine tuberculosis, contracted after drinking infected cow's milk as a boy.[12] Turing's religious faith was shattered and he became an atheist. He adopted the conviction that all phenomena, including the workings of the human brain, must be materialistic.[13]
University and his work on computability
Turing's unwillingness to work as hard on his classical studies as on science and mathematics meant failure to win a scholarship to Trinity College, Cambridge, and he went on to the college of his second choice, King's College, Cambridge. He was an undergraduate there from 1931 to 1934, graduating with a distinguished degree, and in 1935 was elected a fellow at King's on the strength of a dissertation on the central limit theorem.
In his momentous paper "On Computable Numbers, with an Application to the Entscheidungsproblem"[14] (submitted on 28 May 1936), Turing reformulated Kurt Gödel's 1931 results on the limits of proof and computation, replacing Gödel's universal arithmetic-based formal language with what are now called Turing machines, formal and simple devices. He proved that some such machine would be capable of performing any conceivable mathematical problem if it were representable as an algorithm, even if no actual Turing machine would be likely to have practical applications, being much slower than practically realisable alternatives.
Turing machines are to this day the central object of study in theory of computation. He went on to prove that there was no solution to the Entscheidungsproblem by first showing that the halting problem for Turing machines is undecidable: it is not possible to decide, in general, algorithmically whether a given Turing machine will ever halt. While his proof was published subsequent to Alonzo Church's equivalent proof in respect to his lambda calculus, Turing's work is considerably more accessible and intuitive. It was also novel in its notion of a 'Universal (Turing) Machine', the idea that such a machine could perform the tasks of any other machine. The paper also introduces the notion of definable numbers.
From September 1936 to July 1938 he spent most of his time at the Institute for Advanced Study, Princeton University, studying under Alonzo Church. As well as his pure mathematical work, he studied cryptology and also built three of four stages of an electro-mechanical binary multiplier.[15] In June 1938 he obtained his Ph.D. from Princeton; his dissertation introduced the notion of relative computing, where Turing machines are augmented with so-called oracles, allowing a study of problems that cannot be solved by a Turing machine.
Back in Cambridge, he attended lectures by Ludwig Wittgenstein about the foundations of mathematics.[16] The two argued and disagreed, with Turing defending formalism and Wittgenstein arguing that mathematics does not discover any absolute truths but rather invents them.[17] He also started to work part-time with the Government Code and Cypher School (GCCS).
Cryptanalysis
![](http://upload.wikimedia.org/wikipedia/commons/thumb/c/cd/Turing_flat.jpg/220px-Turing_flat.jpg)
During the Second World War, Turing was a main participant in the efforts at Bletchley Park to break German ciphers. Building on cryptanalysis work carried out in Poland by Marian Rejewski, Jerzy Różycki and Henryk Zygalski from Cipher Bureau before the war, he contributed several insights into breaking both the Enigma machine and the Lorenz SZ 40/42 (a Teletype cipher attachment codenamed "Tunny" by the British), and was, for a time, head of Hut 8, the section responsible for reading German naval signals.
Since September 1938, Turing had been working part-time for the Government Code and Cypher School (GCCS), the British code breaking organisation. He worked on the problem of the German Enigma machine, and collaborated with Dilly Knox, a senior GCCS codebreaker.[18] On 4 September 1939, the day after the UK declared war on Germany, Turing reported to Bletchley Park, the wartime station of GCCS.[19]
Turing–Welchman bombe
![](http://upload.wikimedia.org/wikipedia/commons/thumb/5/5c/Bombe-rebuild.jpg/220px-Bombe-rebuild.jpg)
Within weeks of arriving at Bletchley Park,[19] Turing had designed an electromechanical machine which could help break Enigma faster than bomba from 1932, the bombe, named after and building upon the original Polish-designed bomba. The bombe, with an enhancement suggested by mathematician Gordon Welchman, became one of the primary tools, and the major automated one, used to attack Enigma-protected message traffic.
Professor Jack Good, cryptanalyst working at the time with Turing at Bletchley Park, later said: "Turing's most important contribution, I think, was of part of the design of the bombe, the cryptanalytic machine. He had the idea that you could use, in effect, a theorem in logic which sounds to the untrained ear rather absurd; namely that from a contradiction, you can deduce everything."[20]
The bombe searched for possibly correct settings used for an Enigma message (i.e., rotor order, rotor settings, etc.), and used a suitable "crib": a fragment of probable plaintext. For each possible setting of the rotors (which had of the order of 1019 states, or 1022 for the U-boat Enigmas which eventually had four rotors, compared to the usual Enigma variant's three),[21] the bombe performed a chain of logical deductions based on the crib, implemented electrically. The bombe detected when a contradiction had occurred, and ruled out that setting, moving onto the next. Most of the possible settings would cause contradictions and be discarded, leaving only a few to be investigated in detail. Turing's bombe was first installed on 18 March 1940.[22] Over two hundred bombes were in operation by the end of the war.[23]
Hut 8 and Naval Enigma
In December 1940, Turing solved the naval Enigma indicator system, which was more mathematically complex than the indicator systems used by the other services. Turing also invented a Bayesian statistical technique termed "Banburismus" to assist in breaking naval Enigma. Banburismus could rule out certain orders of the Enigma rotors, reducing time needed to test settings on the bombes.
In the spring of 1941, Turing proposed marriage to Hut 8 co-worker Joan Clarke, although the engagement was broken off by mutual agreement in the summer.
In July 1942, Turing devised a technique termed Turingismus or Turingery for use against the Lorenz cipher used in the Germans' new Geheimschreiber machine ("secret writer") which was one of those codenamed "Fish". He also introduced the Fish team to Tommy Flowers who, under the guidance of Max Newman, went on to build the Colossus computer, the world's first programmable digital electronic computer, which replaced simpler prior machines (including the "Heath Robinson") and whose superior speed allowed the brute-force decryption techniques to be applied usefully to the daily-changing cyphers.[24] A frequent misconception is that Turing was a key figure in the design of Colossus; this was not the case.[25]
While working at Bletchley, Turing, a talented long-distance runner, occasionally ran the 40 miles to London when he was needed for high-level meetings.[26]
Turing travelled to the United States in November 1942 and worked with U.S. Navy cryptanalysts on Naval Enigma and bombe construction in Washington, and assisted at Bell Labs with the development of secure speech devices. He returned to Bletchley Park in March 1943. During his absence, Hugh Alexander had officially assumed the position of head of Hut 8, although Alexander had been de facto head for some time—Turing having little interest in the day-to-day running of the section. Turing became a general consultant for cryptanalysis at Bletchley Park.
In the latter part of the war he moved to work at Hanslope Park, where he further developed his knowledge of electronics with the assistance of engineer Donald Bailey. Together they undertook the design and construction of a portable secure voice communications machine codenamed Delilah.[27] It was intended for different applications, lacking capability for use with long-distance radio transmissions, and in any case, Delilah was completed too late to be used during the war. Though Turing demonstrated it to officials by encrypting/decrypting a recording of a Winston Churchill speech, Delilah was not adopted for use.
In 1945, Turing was awarded the OBE for his wartime services, but his work remained secret for many years. A biography published by the Royal Society shortly after his death recorded:
Three remarkable papers written just before the war, on three diverse mathematical subjects, show the quality of the work that might have been produced if he had settled down to work on some big problem at that critical time. For his work at the Foreign Office he was awarded the OBE.
— Newman, M. H. A. (1955). Alan Mathison Turing. Biographical Memoirs of Fellows of the Royal Society, 1955, Volume 1. The Royal Society.
Early computers and the Turing test
From 1945 to 1947 he was at the National Physical Laboratory, where he worked on the design of the ACE (Automatic Computing Engine). He presented a paper on 19 February 1946, which was the first detailed design of a stored-program computer.[28] Although ACE was a feasible design, the secrecy surrounding the wartime work at Bletchley Park led to delays in starting the project and he became disillusioned. In late 1947 he returned to Cambridge for a sabbatical year. While he was at Cambridge, the Pilot ACE was built in his absence. It executed its first program on 10 May 1950.
In 1948 he was appointed Reader in the Mathematics Department at Manchester. In 1949 he became deputy director of the computing laboratory at the University of Manchester, and worked on software for one of the earliest true computers — the Manchester Mark 1. During this time he continued to do more abstract work, and in "Computing machinery and intelligence" (Mind, October 1950), Turing addressed the problem of artificial intelligence, and proposed an experiment now known as the Turing test, an attempt to define a standard for a machine to be called "intelligent". The idea was that a computer could be said to "think" if it could fool an interrogator into thinking that the conversation was with a human. In the paper, Turing suggested that rather than building a program to simulate the adult mind, it would be better rather to produce a simpler one to simulate a child's mind and then to subject it to a course of education. This approach is adopted by the Texai.org project.[29]
In 1948, Turing, working with his former undergraduate colleague, D.G. Champernowne, began writing a chess program for a computer that did not yet exist. In 1952, lacking a computer powerful enough to execute the program, Turing played a game in which he simulated the computer, taking about half an hour per move. The game was recorded;[30] the program lost to Turing's colleague Alick Glennie, although it is said that it won a game against Champernowne's wife.
Pattern formation and mathematical biology
Turing worked from 1952 until his death in 1954 on mathematical biology, specifically morphogenesis. He published one paper on the subject called "The Chemical Basis of Morphogenesis" in 1952, putting forth the Turing hypothesis of pattern formation.[31] His central interest in the field was understanding Fibonacci phyllotaxis, the existence of Fibonacci numbers in plant structures. He used reaction–diffusion equations which are now central to the field of pattern formation. Later papers went unpublished until 1992 when Collected Works of A.M. Turing was published.
Conviction for gross indecency
In January 1952 Turing picked up the 19-year-old Arnold Murray outside a cinema in Manchester. After a lunch date, Turing invited Murray to spend the weekend with him at his house, an invitation which Murray accepted although he did not show up. The pair met again in Manchester the following Monday, when Murray agreed to accompany Turing to the latter's house. A few weeks later Murray visited Turing's house again, and apparently spent the night there.[32]
After Murray helped an accomplice to break into his house, Turing reported the crime to the police. During the investigation Turing acknowledged a sexual relationship with Murray. Homosexual acts were illegal in the United Kingdom at that time,[5] and so both were charged with gross indecency under Section 11 of the Criminal Law Amendment Act 1885, the same crime that Oscar Wilde had been convicted of more than fifty years earlier.[33]
Turing was given a choice between imprisonment or probation conditional on his agreement to undergo hormonal treatment designed to reduce libido. He accepted chemical castration via estrogen hormone injections,[34] which lasted for a year. Turing's conviction led to the removal of his security clearance, and barred him from continuing with his cryptographic consultancy for GCHQ. At the time, there was acute public anxiety about spies and homosexual entrapment by Soviet agents, possibly due to the recent exposure of the first two members of the Cambridge Five, Guy Burgess and Donald Maclean, as KGB double agents. Turing was never accused of espionage but, as with all who had worked at Bletchley Park, was prevented from discussing his war work.
Death
On 8 June 1954, Turing's cleaner found him dead; the previous day, he had died of cyanide poisoning, apparently from a cyanide-laced apple he left half-eaten beside his bed. The apple itself was never tested for contamination with cyanide, but a post-mortem established that the cause of death was cyanide poisoning. Most believe that his death was intentional, and the death was ruled a suicide.
His mother, however, strenuously argued that the ingestion was accidental due to his careless storage of laboratory chemicals. Biographer Andrew Hodges suggests that Turing may have killed himself in this ambiguous way quite deliberately, to give his mother some plausible deniability.[35] Others suggest that Turing was re-enacting a scene from Snow White, his favourite fairy tale.[36]
Because Turing's homosexuality was perceived as a security risk, the possibility of assassination has also been suggested.[37] Supporters of the assassination theory point out that Turing's British passport was not revoked after his conviction (although he was denied entry to the United States). He was still free to teach mathematics and to travel to other European countries, which he did on many occasions.
His remains were cremated at Woking crematorium on 12 June 1954.
Posthumous recognition
Since 1966, the Turing Award has been given annually by the Association for Computing Machinery to a person for technical contributions to the computing community. It is widely considered to be the computing world's equivalent to the Nobel Prize.[38]
Alan Turing is cited as a hero by American novelist Thomas Pynchon; his acclaimed 1973 novel Gravity's Rainbow was, allegedly, in part inspired by Turing.
Breaking the Code is a 1986 play by Hugh Whitemore about Alan Turing. The play ran in London's West End beginning in November 1986 and on Broadway from November 15, 1987 to April 10, 1988. There was also a 1996 BBC television production. In all cases, Derek Jacobi had the title role. The Broadway production was nominated for three Tony Awards including Best Actor in a Play, Best Featured Actor in a Play, and Best Direction of a Play, and for two Drama Desk Awards, for Best Actor and Best Featured Actor.
Various tributes to Turing have been made in Manchester, the city where he worked towards the end of his life. In 1994 a stretch of the A6010 road (the Manchester city intermediate ring road) was named Alan Turing Way. A bridge carrying this road was widened, and carries the name 'Alan Turing Bridge'.
A statue of Turing was unveiled in Manchester on 23 June 2001. It is in Sackville Park, between the University of Manchester building on Whitworth Street and the Canal Street 'gay village'. A celebration of Turing's life and achievements arranged by the British Logic Colloquium and the British Society for the History of Mathematics was held on 5 June 2004 at the University of Manchester; the Alan Turing Institute was initiated in the university that summer. The building housing the School of Mathematics, the Photon Science Institute and the Jodrell Bank Centre for Astrophysics is named the Alan Turing Building and was opened in July 2007.
On 23 June 1998, on what would have been Turing's 86th birthday, Andrew Hodges, his biographer, unveiled an official English Heritage Blue Plaque at his birthplace and childhood home in Warrington Crescent, London, now the Colonnade hotel.[39][40] To mark the 50th anniversary of his death, a memorial plaque was unveiled on 7 June 2004 at his former residence, Hollymeade, in Wilmslow, south Manchester.
![](http://upload.wikimedia.org/wikipedia/commons/thumb/1/19/Turing_Plaque.jpg/220px-Turing_Plaque.jpg)
For his achievements in computing, various universities have honoured him. On 28 October 2004 a bronze statue of Alan Turing sculpted by John W Mills was unveiled at the University of Surrey in Guildford.[41] The statue marks the 50th anniversary of Turing's death. It portrays him carrying his books across the campus. Turing Road in the University's Research Park predates this.
A building in the School of Technology at Oxford Brookes University is called the Turing Building.
The Polytechnic University of Puerto Rico and Los Andes University in Bogotá, Colombia, both have computer laboratories named after Turing. The University of Texas at Austin has an honours computer science programme named the Turing Scholars. Istanbul Bilgi University organises an annual conference on the theory of computation called Turing Days.[42] The computer room in King's College, Cambridge is named the "Turing Room" after him. Carnegie Mellon University has a granite bench, situated in The Hornbostel Mall, with the name "A. M. Turing" carved across the top, "Read" down the left leg, and "Write" down the other. The Boston GLBT pride organization named Turing their 2006 Honorary Grand Marshal.[43]
Alan Turing also appears in 2000 novel Cryptonomicon by Neal Stephenson. In the novel, Turing is depicted as his real life persona and his work at Bletchley Park is covered.
On 13 March 2000, St Vincent & The Grenadines issued a set of stamps to celebrate the greatest achievements of the twentieth century, one of which carries a recognisable portrait of Turing against a background of repeated 0s and 1s, and is captioned '1937: Alan Turing's theory of digital computing'.
A 1.5-ton, life-size statue of Turing was unveiled on 19 June 2007 at Bletchley Park. Built from approximately half a million pieces of Welsh slate, it was sculpted by Stephen Kettle, having been commissioned by the late American billionaire Sidney Frank.[44]
The Turing Relay[45] is a six-stage relay race on riverside footpaths from Ely to Cambridge and back. These paths were used for running by Turing while at Cambridge; his marathon best time was 2 hours, 46 minutes.[46] The marathon world best time in the early 1940s was in the range of 2 hours, 25 minutes.
See also
- Unorganized machine
- Good–Turing frequency estimation
- Philosophy of information
- Turing degree
- Turing switch
- Alan Turing Year
References
- ^ Gray, Paul (1999-03-29). "Time 100: Alan Turing". Time.com. Retrieved 2009-06-18.
- ^ A.M. Turing, "The Chemical Basis of Morphogenesis", Philosophical Transactions of The Royal Society of London, series B, volume 237, pages 37–72, 1952.
- ^ Hodges, 1983, p. 5
- ^ "London Blue Plaques". English-Heritage.org.uk. Retrieved 2007-02-10.
- ^ a b Hodges, Andrew (1983). Alan Turing: The Enigma. New York: Simon & Schuster. p. 5. ISBN 0-671-49207-1.
- ^ "The Alan Turing Internet Scrapbook". Retrieved 2006-09-26.
- ^ "Hastings Blue Plaque Trail". Retrieved 2008-08-10.
- ^ Jones, G. James (2001-12-11). "Alan Turing - Towards a Digital Mind: Part 1". System Toolbox. Retrieved 2007-07-27.
- ^ Hofstadter, Douglas R. (1985). Metamagical Themas: Questing for the Essence of Mind and Pattern. Basic Books. ISBN 0-465-04566-9. OCLC 230812136.
- ^ Hodges, 1983, p. 26
- ^ Hodges, 1983, p. 34
- ^ ** Teuscher, Christof (ed.) (2004). Alan Turing: Life and Legacy of a Great Thinker. Springer-Verlag. ISBN 3-540-20020-7. OCLC 53434737 62339998.
{{cite book}}
:|first=
has generic name (help); Check|oclc=
value (help) - ^ Paul Gray, "Alan Turing," Time Magazine's Most Important People of the Century, p.2 [1]
- ^ Turing, A.M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2, vol. 42 (published 1937), pp. 230–65, doi:10.1112/plms/s2-42.1.230 (and Turing, A.M. (1938), "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction", Proceedings of the London Mathematical Society, 2, vol. 43 (published 1937), pp. 544–6, doi:10.1112/plms/s2-43.6.544)
- ^ Hodges, 1983, p. 138
- ^ Hodges, 1983, p. 152
- ^ Hodges, 1983, pp. 153-154
- ^ Jack Copeland, "Colossus and the Dawning of the Computer Age", p. 352 in Action This Day, 2001
- ^ a b Copeland, 2006 p. 378
- ^ "The Men Who Cracked Enigma", 2003.
- ^ Professor Jack Good in "The Men Who Cracked Enigma", 2003: with his caveat: "if my memory is correct"
- ^ Hodges, 1983, p. 191.
- ^ Copeland, Jack (2004). "Alan Turing, Codebreaker and Computer Pioneer". Retrieved 2007-07-27.
{{cite web}}
: Unknown parameter|coauthors=
ignored (|author=
suggested) (help); Unknown parameter|month=
ignored (help) - ^ Copeland, 2006, p. 72.
- ^ Copeland, 2006, pp. 382-383.
- ^ Bodyguard of Lies, by Anthony Cave Brown, 1975.
- ^ Hodges, 1983, p. 270
- ^ Copeland, 2006, p. 108.
- ^ Bootstrap Dialog: A Conversational English Text Parsing and Generation System, in Artificial General Intelligence Conference Proceedings, Arlington, Virginia, USA, (2009)
- ^ Alan Turing vs Alick Glennie (1952) "Turing Test."
- ^ "Control Mechanism For Biological Pattern Formation Decoded" in ScienceDaily (Nov. 30, 2006)
- ^ Leavitt 2007, p. 266
- ^ Leavitt 2007, p. 268
- ^ Turing, Alan (1912–1954)
- ^ Hodges, 1983, pp. 488-489.
- ^ Ferris, Timothy. Seeing in the Dark. 2002. p. 250
- ^ Leavitt, David (2006). The man who knew too much: Alan Turing and the invention of the computer. New York: W. W. Norton. ISBN 0-393-05236-2. OCLC 233002606 60742103.
{{cite book}}
: Check|oclc=
value (help) - ^ Steven Geringer (27 July 2007). "ACM'S Turing Award Prize Raised To $250,000". ACM press release. Retrieved 2008-10-16.
- ^ "Unveiling the official Blue Plaque on Alan Turing's Birthplace". Retrieved 2006-09-26.
- ^ "About this Plaque - Alan Turing". Retrieved 2006-09-25.
- ^ "The Earl of Wessex unveils statue of Alan Turing". Retrieved 2007-02-10.
- ^ "Turing Days @ İstanbul Bilgi University". Retrieved 2007-02-10.
- ^ "Honorary Grand Marshal". Retrieved 2007-02-10.
- ^ Bletchley Park Unveils Statue Commemorating Alan Turing, Bletchley Park press release, 20 June 2007
- ^ Turing Trail Relay
- ^ The Alan Turing Internet Scrapbook: Alan Turing: world class distance runner
Further reading
- Agar, Jon (2002). The Government Machine. Cambridge, Massachusetts: The MIT Press. ISBN 0-262-01202-2
- Beniger, James (1986). The Control Revolution: Technological and Economic Origins of the Information Society. Cambridge, Massachusetts: Harvard University Press. ISBN 0-674-16986-7
- Bodanis, David (2005). Electric Universe: How Electricity Switched on the Modern World. New York: Three Rivers Press. ISBN 0-307-33598-4. OCLC 61684223.
- Campbell-Kelly, Martin (ed.) (1994). Passages in the Life of a Philosopher. London: William Pickering. ISBN 0-8135-2066-5
- Campbell-Kelly, Martin, and Aspray, William (1996). Computer: A History of the Information Machine. New York: Basic Books. ISBN 0-465-02989-2
- Ceruzzi, Paul (1998). A History of Modern Computing. Cambridge, Massachusetts, and London: MIT Press. ISBN 0-262-53169-0
- Chandler, Alfred (1977). The Visible Hand: The Managerial Revolution in American Business. Cambridge, Massachusetts: Belknap Press. ISBN 0-674-94052-0
- Copeland, B. Jack (2004). "Colossus: Its Origins and Originators". IEEE Annals of the History of Computing. 26 (4): 38–45. doi:10.1109/MAHC.2004.26.
- Copeland, B. Jack (ed.) (2004). The Essential Turing. Oxford: Oxford University Press. ISBN 0-19-825079-7. OCLC 156728127 224173329 48931664 57434580 57530137 59399569.
{{cite book}}
:|first=
has generic name (help); Check|oclc=
value (help) - Copeland (ed.), B. Jack (2005). Alan Turing's Automatic Computing Engine. Oxford: Oxford University Press. ISBN 0-19-856593-3. OCLC 224640979 56539230.
{{cite book}}
:|last=
has generic name (help); Check|oclc=
value (help) - B. Jack Copeland ; edited by B. Jack Copeland.; et al. (2006), Copeland, B. Jack (ed.), Colossus: The Secrets of Bletchley Park's Codebreaking Computers, Oxford: Oxford University Press, ISBN 978-0-19-284055-4, OCLC 238755360 51315364 62179172
{{citation}}
:|author=
has generic name (help); Check|oclc=
value (help); Explicit use of et al. in:|author=
(help)CS1 maint: multiple names: authors list (link) - Edwards, Paul N (1996). The Closed World. Cambridge, Massachusetts: MIT Press. ISBN 0-262-55028-8
- Hodges, Andrew (1983). Alan Turing: The Enigma of Intelligence. London: Burnett Books. ISBN 0-04-510060-8
- Hochhuth, Rolf. Alan Turing
- Leavitt, David (2007), The Man Who Knew Too Much; Alan Turing and the invention of the computer, Phoenix, ISBN 978-0-7538-2200-5
- Lubar, Steven (1993) Infoculture. Boston and New York: Houghton Mifflin. ISBN 0-395-57042-5
- O'Connor, John J.; Robertson, Edmund F., "Alan Mathison Turing", MacTutor History of Mathematics Archive, University of St Andrews
- Petzold, Charles (2008). "The Annotated Turing: A Guided Tour through Alan Turing's Historic Paper on Computability and the Turing Machine". Indianapolis: Wiley Publishing. ISBN 978-0-470-22905-7
- Smith, Roger (1997). Fontana History of the Human Sciences. London: Fontana.
- Weizenbaum, Joseph (1976). Computer Power and Human Reason. London: W.H. Freeman. ISBN 0-7167-0463-3
- Williams, Michael R. (1985). A History of Computing Technology. Englewood Cliffs, New Jersey: Prentice-Hall. ISBN 0-8186-7739-2
- Yates, David M. (1997). Turing's Legacy: A history of computing at the National Physical Laboratory 1945 – 1995. London: London Science Museum. ISBN 0-901805-94-7. OCLC 123794619 40624091.
{{cite book}}
: Check|oclc=
value (help) - Turing's mother, Sara Turing, who survived him by many years, wrote a biography of her son glorifying his life. Published in 1959, it could not cover his war work; scarcely 300 copies were sold (Sara Turing to Lyn Newman, 1967, Library of St John's College, Cambridge). The six-page foreword by Lyn Irvine includes reminiscences and is more frequently quoted.
- Breaking the Code is a 1986 play by Hugh Whitemore, telling the story of Turing's life and death. In the original West End and Broadway runs, Derek Jacobi played Turing – and he recreated the role in a 1997 television film based on the play made jointly by the BBC and WGBH, Boston. The play is published by Amber Lane Press, Oxford. ASIN: B000B7TM0Q
External links
![](http://upload.wikimedia.org/wikipedia/commons/thumb/f/fa/Wikiquote-logo.svg/34px-Wikiquote-logo.svg.png)
![](http://upload.wikimedia.org/wikipedia/en/thumb/4/4a/Commons-logo.svg/30px-Commons-logo.svg.png)
- Alan Turing site maintained by Andrew Hodges including a short biography
- Alan Turing at the Mathematics Genealogy Project
- Alan Turing – Towards a Digital Mind: Part 1
- Alan Turing at Find a Grave
- AlanTuring.net - Turing Archive for the History of Computing by Jack Copeland
- O'Connor, John J.; Robertson, Edmund F., "Alan Turing", MacTutor History of Mathematics Archive, University of St Andrews
- Stanford Encyclopedia of Philosophy entry
- The Turing Archive - contains scans of some unpublished documents and material from the Kings College archive
- Time 100:Alan Turing
- Alan Turing in the RKBExplorer
- The Mind and the Computing Machine a 1949 discussion of Alan Turing and others
- Alan Turing Year website
- CiE 2012: Turing Centenary Conference website
Papers
- An extensive list of Turing's papers, reports and lectures, plus translated versions and collections
- Turing, Alan (October 1950), "Computing Machinery and Intelligence", Mind, LIX (236): 433–460, doi:10.1093/mind/LIX.236.433, ISSN 0026-4423
- Turing's paper titled "On Computable Numbers with an Application to the Entscheidungsproblem" (PDF)
Template:Persondata {{subst:#if:|Warning: Default sort key "{{{3}}}" overrides earlier default sort key "Turing, Alan".}} [[Category:{{subst:#switch:{{subst:uc:1912}}
|| UNKNOWN | MISSING = Year of birth missing {{subst:#switch:{{subst:uc:1954}}||LIVING=(living people)}} | #default = 1912 births
}}]] {{subst:#switch:{{subst:uc:1954}}
|| LIVING = | MISSING = | UNKNOWN = | #default =
}}
- Alan Turing
- Living people
- 1954 deaths
- 20th-century mathematicians
- 20th-century philosophers
- Academics of the University of Manchester
- Alumni of King's College, Cambridge
- Artificial intelligence researchers
- British cryptographers
- British people of World War II
- Computer designers
- Computer pioneers
- English atheists
- English computer scientists
- English inventors
- English mathematicians
- English philosophers
- Fellows of the Royal Society
- Formal methods people
- History of artificial intelligence
- LGBT people from England
- Long-distance runners
- Mathematicians who committed suicide
- Members of the Order of the British Empire
- Old Shirburnians
- Officers of the Order of the British Empire
- People associated with Bletchley Park
- People prosecuted under anti-homosexuality laws
- Philosophers of mind
- Princeton University alumni
- Scientists who committed suicide
- Suicides by poison
- Suicides in England
- Theoretical computer scientists
- Victims of psychiatric repression
- People from Maida Vale