A Biography of Alan Turing, with Mathematics.
From the middle name one may suspect a certain class value,although the "Math" bit is a strange coincidence.
His father went to Oxford and then worked for the Indian Civil Service. His mother's father also worked in India. He was born in 1912, their second son. 1926 his father retired so perhaps he had something of normal family life from then on. Went to Sherborne, one of older public schools. Whilst there he became a close friend of Christopher Morcom. He was Alan's first love although Chris as in no way homosexual.
Has been called "his unfulfilled ideal" Otherwise only short liasons. Alan said "worshipped ground he trod on" . Could discuss science together overcoming alan's*…show more content…*

Any +ve int. >2 is sum of 2 prime numbers. Two questions. How do we prove this, but also CAN we ever prove it. Third problem became the great mathematical challenge of the age. Turing solved it, but in the process established a system that is still useable today. Am indebted to Oxford university course on computing for the following, which I reproduce without a full understanding. Turing’s (successful) approach to the decidability problem involved the design and use of an imaginary machine. This is the same technique...gedanken...that was used by Albert Einstein, in relation to relativity and in 'Schrodinger’s Cat' reference quantum mechanics. Turing’s machine used a continuous tape, which can be as long as required, which carries a series of cells. This passes under a read/write head that can read and if required change the symbol under it. The head views one symbol at a time and, can: move, or not move, the tape one cell in either direction; read and /or change the symbol written on that cell; or change states. The ‘states’ are a finite number of conditions, e.g. start, add, carry, return and stop. Different sets of states will be needed for different problems. Turing was able to show that if we first assume a solution does exist then we can show that this would lead to a completely impossible situation. Hence a solution does not exist (proof by contradiction, a standard method in mathematics.). When Turing went to show his

Any +ve int. >2 is sum of 2 prime numbers. Two questions. How do we prove this, but also CAN we ever prove it. Third problem became the great mathematical challenge of the age. Turing solved it, but in the process established a system that is still useable today. Am indebted to Oxford university course on computing for the following, which I reproduce without a full understanding. Turing’s (successful) approach to the decidability problem involved the design and use of an imaginary machine. This is the same technique...gedanken...that was used by Albert Einstein, in relation to relativity and in 'Schrodinger’s Cat' reference quantum mechanics. Turing’s machine used a continuous tape, which can be as long as required, which carries a series of cells. This passes under a read/write head that can read and if required change the symbol under it. The head views one symbol at a time and, can: move, or not move, the tape one cell in either direction; read and /or change the symbol written on that cell; or change states. The ‘states’ are a finite number of conditions, e.g. start, add, carry, return and stop. Different sets of states will be needed for different problems. Turing was able to show that if we first assume a solution does exist then we can show that this would lead to a completely impossible situation. Hence a solution does not exist (proof by contradiction, a standard method in mathematics.). When Turing went to show his

Related

- Satisfactory Essays
## Alan Turing Research Paper

- 385 Words
- 2 Pages

~Alan Turing~ By: Matthew Medrano Alan Turing was born in June 23, 1912, Maida Vale. He later died in Wilmslow, United Kingdom, in June 7, 1954. On 8 June 1954, Turing's housekeeper found him dead. He had died the previous day. His full name is Alan Mathison Turing. A post-mortem examination established that the cause of death was cyanide poisoning. An inquest determined that he had committed suicide, and he was cremated at Woking Crematorium on 12 June 1954. In 1941, Turing proposed marriage

- 385 Words
- 2 Pages

Satisfactory Essays - Better Essays
## Similarities Between Alan Turing And Grace Hopper

- 1384 Words
- 6 Pages

The Hoang Professor Raymond P.Hicks EMLS 112 21 November 2017 The similarities between Alan Turing and Grace Hopper Alan Turing and Grace Hopper are considered two of the most famous pioneer in computer science, it’s because of their contribution in the past that mankind can achieve lots of great things and have a peaceful life as we know. Alan Turing is the person who invented the Turing Machine which is the hypothetical machine that every modern computer nowadays all base on. Grace Hopper is the

- 1384 Words
- 6 Pages

Better Essays - Satisfactory Essays
## The Imitation Game: Life Of Alan Turing

- 467 Words
- 2 Pages

"The Imitation Game" is a film about Britain's darkest days in WWII and the life of Alan Turing. In 1939, an extremely intelligence group that needed to break the Nazi code, had been hired in Government Code and Cipher School at Bletchley Park. Their gathering was all about breaking Nazi codes, with the exception of Turing (Eliana Dockterman). Turing's machine, Christopher, required the reservation of £100,000 from the legislature or council to be built (Tnn). The machine at long last worked, however

- 467 Words
- 2 Pages

Satisfactory Essays - Decent Essays
## Alan Mathison Turing: Astonishing Cultural Reappraisal

- 914 Words
- 4 Pages

Introduction Within the last thirty years, the pioneering British computer scientist and Cambridge academic Alan Mathison Turing (1912-1954) has undergone an astonishing cultural reappraisal. Turing was never particularly famous during his own lifetime, but his work on cryptography at Bletchley Park, his key 1936 paper On Computable Numbers, and his early digital machines such as the programmable Pilot ACE and his 1947-1954 work at the University of Manchester was unquestionably used and appreciated

- 914 Words
- 4 Pages

Decent Essays - Good Essays
## The Imitation Game

- 1387 Words
- 6 Pages

unto a moment of imagination as the melodic piano symphony released me into a sensation of suspense. The Imitation Game is a 2014 Academy Award winning Biographical film and a fact-based story on English Mathematician, Logician and Cryptanalyst Alan Turing. During World War II he developed a complex system which had the capabilities of breaking an unbreakable Nazi Code, helping the Allies win the war. Although,

- 1387 Words
- 6 Pages

Good Essays - Decent Essays
## Alan Turing As A Hero

- 1311 Words
- 6 Pages

Alan Turing is a rare figure amongst the many historical worthies of post-war Britain. He would, at first, seem an unlikely candidate to become a popular icon. He worked within a comparatively novel and arcane scientific field, the central concepts of which are still only fully understood by specialists. It was one which emerged from mostly from his own high-level theoretical reasoning and debating the earlier work of the similarly obscure Kurt Gödel upon whether mathematical processes could truly

- 1311 Words
- 6 Pages

Decent Essays - Decent Essays
## Alan Turing: A Historical Worthies Of Post-War Britain

- 1464 Words
- 6 Pages

Alan Turing is a rare figure amongst the many historical worthies of post-war Britain. He would, at first, seem an unlikely candidate to become a popular, globally recognised icon. He worked within a comparatively novel and arcane scientific field, the central concepts of which are still only fully understood by specialists. It was one which emerged from mostly from his own high-level theoretical reasoning and debating the earlier work of (the similarly obscure) Kurt Gödel upon whether mathematical

- 1464 Words
- 6 Pages

Decent Essays - Decent Essays
## Alan Turing's Astonishing Reappraisal

- 990 Words
- 4 Pages

Cambridge academic Alan Mathison Turing (1912-1954) has undergone an astonishing reappraisal. His major work on breaking Enigma Codes, his key 1936 paper On Computable Numbers (describing a theoretical machine that could solve any mathematical problem given enough time), and his early digital machines such as the programmable Pilot ACE (most notably his work at the University of Manchester between 1947 and 1954) was unquestionably used and appreciated while he still lived.1 However, Turing is competitively

- 990 Words
- 4 Pages

Decent Essays - Decent Essays
## Turing In Vietnam War

- 801 Words
- 4 Pages

political talking point, without significant academic groundwork. Scientific biographers and historians have provided the first vital building blocks for others to shape Turing into a distinct cultural presence. However, truly original secondary material is still scarce. 1 Surprisingly few volumes have been dedicated solely to studying Turing alone, of which most date from 1992 onwards. This is perhaps due to the fact that accounts of him and his primary documentation remained partially classified and

- 801 Words
- 4 Pages

Decent Essays - Decent Essays
## Ada Lovelace Obstacles

- 379 Words
- 2 Pages

Ada met another famous figure of computer science, Charles Babbage, who helped shape the work she would do. Unfortunately, Ada spent much of her life in poor health due to contracting cholera at the age of 22 (Biography.com Editors, "Ada Lovelace Biography", 2016). Despite the obstacles, Ada Lovelace has gone down in the annals of history as one of the founders of computer science. While Ada

- 379 Words
- 2 Pages

Decent Essays