Turin Test
Alan Mathison Turing Born in London on June 23, 1912 - Wilmslow, Cheshire, June 7, 1954, was a mathematician, logician, computer scientist, and cryptographer British philosopher. It is considered one of the fathers of computer science being the pioneer of modern computing. He provided an influential formalization of the concepts of algorithm and computation: the Turing machine. He formulated his own version of the now widely accepted Church-Turing thesis. The hopes and ambitions of Turing at school were planted by the close friendship he developed with a slightly larger companion, Christopher Morcom, 2 who was Turing's first love In 1928, at sixteen, Turing discovered the work of Albert Einstein and could not only understand, but also inferred criticism of Einstein to Newton's Laws of reading a text that were not explicit. During school age, Turing was a young man whose optimism and ambitions is further aggravated due in large part to his strong bond with his friend Christopher Morcom, whose death still young, profoundly affect Turing. During World War II he was one of the main architects of the work of Bletchley Park to decipher the Nazi secret codes. His insightful comments contributed math to break the Enigma code machine and teletype coders FISH (coded teletype machines manufactured jointly Lorenz Electric and Siemens & Halske). His studies of the Fish system would help the further development of the first programmable computer digital electronics called Colossus, which was designed by Max Newman and his team, and built in the Research Station Post Dollis Hill by a team led by Thomas Flowers in 1943 . This computer was used to decipher the codes Fish (specifically transmissions Lorenz machine). turning test is a test proposed by Alan Turing to prove the existence of intelligence in a machine. It was exhibited in 1950 in an article (Computing machinery and intelligence) for the journal Mind, and remains one of the best methods for proponents of artificial intelligence The test consists of a challenge. A judge located in one room, a machine and a human in another is assumed. The judge must find out what is human and what is machine, the two estándoles allowed to lie or wrong answer written questions that the judge made them. Turing thesis implies that if both players are skilled enough, the judge can not tell who is human and who the machine.
No comments:
Post a Comment