Alan turing

Subject

Computer Science

Theme

Alan Mathison Turing

Course

Third Technical Baccalaureate

Integrants:

*María José Figueroa.

*Génesis Mendoza.

*Arlette Guzmán.

*Nicole Mejía.

[pic 1]

Alan Mathison Turing, OBE (Paddington, London, June 23, 1912 - Wilmslow, Cheshire, June 7, 1954) was a mathematician, logician, computer scientist, cryptographer, philosopher, ultra marathon runner and British distance runner.

Turing was conceived in Chatrapur (British India). His father Julius Mathison Turing was a member of the body of British officials in India. Julius and Ethel wife wanted their son Alan was born in the UK and returned to Paddington, where finally was born.

It is considered one of the fathers of computer science and a 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 widely accepted today Church-Turing thesis.

During World War II, he worked in deciphering Nazi codes, particularly the Enigma machine, and for a time was the director of the Naval Enigma of Bletchley Park section. After the war he designed one of the first digital programmable electronic computers at the National Physical Laboratory in the UK and soon after built another of the first machines at the University of Manchester.

In the field of artificial intelligence is known for the design of the Turing test, a criterion by which you can judge the intelligence of a machine if its test responses are indistinguishable from those of a human.

Turing's career ended abruptly after being prosecuted for being homosexual. Two years after his conviction he died, according to the official version of suicide, but his death has led to other scenarios including murder.

The December 24, 2013, Queen Elizabeth II promulgated the edict was formally exonerated the mathematician, being canceled all charges against him.

Turing machine.

In his landmark study "The computable numbers with an application to Entscheidungsproblem" (published in 1936), Turing reformulated the results obtained by Kurt Gödel in 1931 on the limits of provability and computers, replacing the universal formal language described by Gödel by what it is now known as the Turing machine, some formal and simple devices.

Turing showed that the machine was able to implement any mathematical problem which may be represented by an algorithm. Turing machines are still the central object of study in the theory of computation.

...