Changes

[[Image:Ture.jpg|right|thumb]]

[[Image:Ture.jpg|right|thumb]]

'''Alan Turing''' (23 June 1912 – 7 June 1954) was a British mathematician who contributed hugely to modern [[computer]] science and [[cryptography]].<ref>Http://www.turing.org.uk/bio</ref> Though perhaps not the father of computer science, he ''" is frequently credited for being the father of theoretical computer science and artificial intelligence."''<ref>[http://books.google.de/books?id=r5kOgS1IB-8C&pg=PA35&hl=de#v=onepage&q&f=false Steven Homer, Alan L. Selman: ''Computability and Complexity Theory''], p. 35</ref>

'''Alan Turing''' (23 June 1912 – 7 June 1954) was a British mathematician who contributed massively to modern [[computer]] science and [[cryptography]].<ref>[http://www.turing.org.uk/bio The Biography of Alan Turing], ''turing.org''</ref> Though perhaps not the father of computer science, he ''"is frequently credited for being the father of theoretical computer science and artificial intelligence."''<ref>[http://books.google.de/books?id=r5kOgS1IB-8C&pg=PA35&hl=de#v=onepage&q&f=false Steven Homer, Alan L. Selman: ''Computability and Complexity Theory''], p. 35</ref>

==The Turing Machine==

==The Turing Machine==

 

In the 1930s Turing proposed the concept of a "[[turing machine|Universal Turing Machine]]". Turing had first proposed that the operations needed to calculate any formula could be broken down into a base set of instructions (or primitive [[Recursion|recursive functions]]) that could, in principle, be followed by a machine: the "Turing Machine". Once fully formalized, the calculations needed to derive the instructions themselves were capable of being run by a Turing Machine. The looped logic allowed the conception of a Turing Machine that could create its own instruction and, in principle, run a huge variety of calculations. Turing then used the concept of Universal Turing Machine to prove the undecidability of the [[halting problem]].

In the 1930s Turing proposed the concept of a "[[turing machine|Universal Turing Machine]]". Turing had, first, proposed that the operations needed to calculate any formula could be broken down into a base set of instructions (or primitive [[Recursion|recursive functions]]) that could in principle be followed by a machine: the "Turing Machine". Once fully formalized the calculations needed to derive the instructions themselves were capable of being run by a Turing Machine. The looped logic allowed the conception of a Turing Machine that could create its own instruction and, in principle, run a huge variety of calculations. Turing then used the concept of Universal Turing Machine to prove the undecidability of the [[halting problem]].

==Code breaking==

==Code breaking==

 

During [[World War II]] Turing was assigned to the codebreaking unit at [[Bletchley Park]], where he worked on the decoding of the German's [[Enigma machine]]. Turing and his colleagues played a significant role in the Allied victory in WWII, allowing Allied forces access to German communication networks throughout much of the war.  

During [[World War II]] Turing was assigned to the codebreaking unit at Bletchley Park, where he worked on the decoding of the German's [[Enigma machine]]. Turing and his colleagues played a significant role in the Allied victory in WW2, allowing Allied forces access to German communication networks throughout much of the war.  

==Artificial intelligence==

==Artificial intelligence==

 

In his 1950 paper "[[Computing]] Machinery and Intelligence" (Mind 49: 433-460) Turing proposed a test (apparently heavily influenced by [[Logical Positivism]]) for establishing whether a computer could think (see [[artificial intelligence]]). This test, the Turing test, is still widely considered to be the best test of whether a machine exhibits [[artificial intelligence]].

In his 1950 paper "[[Computing]] Machinery and Intelligence" (Mind 49: 433-460) Turing proposed a test (apparently heavily influenced by [[Logical Positivism]]) for establishing whether a computer could think (see [[artificial intelligence]]). This test, the turing test, is still widely considered to be the best test of whether a machine exhibits [[artificial intelligence]].

==Death==

==Death==

Turnig was found dead by his housekeeper on June 8, 1954. The cause of death after an autopsy was determined to be cyanide poisoning; however, there was also a half eaten apple beside the bed. The apple was not tested for traces of cyanide.<ref name=hodges>Hodges, Andrew (1983). Alan Turing : the enigma. London: Burnett Books. ISBN 0-09-152130-0.</ref> Turing's death has been cause for much speculation, as parts of it seem accidental; for instance, the poisoning seems more consistent with inhilation than ingestion, leading some to believe that he accidentally inhaled fumes while sleeping from an aparatus of his set up in the spare room.<ref>Pease, Roland (23 June 2012). "Alan Turing: Inquest's suicide verdict 'not supportable'". BBC News.</ref> Some speculate that Turing let the accidental nature of his death happen on purpose, as a way to give his mother [[plausible deniability]].<ref name=hodges/>

Turnig was found dead by his housekeeper on June 8, 1954.<ref>The housekeeper found him the morning after he had died</ref> The cause of death after an autopsy was determined to be cyanide poisoning; however, there was also a half eaten apple beside the bed. The apple was not tested for traces of cyanide.<ref name=hodges>Hodges, Andrew (1983). Alan Turing : the enigma. London: Burnett Books. ISBN 0-09-152130-0.</ref> Turing's death has been cause for much speculation, as parts of it seem accidental; for instance, the poisoning seems more consistent with inhilation than ingestion, leading some to believe that he accidentally inhaled fumes while sleeping from an aparatus of his set up in the spare room.<ref>Pease, Roland (23 June 2012). "Alan Turing: Inquest's suicide verdict 'not supportable'". BBC News.</ref> Some speculate that Turing let the accidental nature of his death happen on purpose, as a way to give his mother [[plausible deniability]].<ref name=hodges/>

On September 10, 2009, British Prime Minister [[Gordon Brown]] issued a statement to "celebrate" Turing's "contribution to Britain’s fight against the darkness of dictatorship" and to acknowledge that his prosecution was "appalling" and "utterly unfair".  "I am pleased," Brown stated, "to have the chance to say how deeply sorry I and we all are for what happened to him."<ref>http://www.number10.gov.uk/Page20571</ref>

On September 10, 2009, British Prime Minister [[Gordon Brown]] issued a statement to "celebrate" Turing's "contribution to Britain’s fight against the darkness of dictatorship" and to acknowledge that his prosecution was "appalling" and "utterly unfair".  "I am pleased," Brown stated, "to have the chance to say how deeply sorry I and we all are for what happened to him."<ref>http://www.number10.gov.uk/Page20571</ref>

==See also==

==See also==

*[http://www.turing.org.uk/bio/ The biography of Alan Turing]

*[[Turing test]]

*[[Enigma (machine)]]

*[http://cogprints.org/499/00/turing.html Computing Machinery and Intelligence]

*[http://cogprints.org/499/00/turing.html Computing Machinery and Intelligence]

*''Oddballs and Eccentrics''.  Shaw, Karl.  Edison, New Jersey: Castle Books, 2004.

*''Oddballs and Eccentrics''.  Shaw, Karl.  Edison, New Jersey: Castle Books, 2004.