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 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>

'''Alan Turing''' (23 June 1912 – 7 June 1954) was a British mathematician who massively contributed 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==

==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", Turing proposed a test (apparently heavily influenced by [[Logical Positivism]]) for establishing whether a computer could think, which he called the Imitation Game. This test, now known as the Turing test, is still widely considered to be the best test of whether a machine exhibits characterisitcs of [[artificial intelligence]].

==Death==

==Death==