Turing Definition and 66 Threads

Alan Mathison Turing (; 23 June 1912 – 7 June 1954) was an English mathematician, computer scientist, logician, cryptanalyst, philosopher, and theoretical biologist. Turing was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. Turing is widely considered to be the father of theoretical computer science and artificial intelligence.Born in Maida Vale, London, Turing was raised in southern England. He graduated at King's College, Cambridge, with a degree in mathematics. Whilst he was a fellow at Cambridge, he published a proof demonstrating that some purely mathematical yes–no questions can never be answered by computation and defined a Turing machine, and went on to prove the halting problem for Turing machines is undecidable. In 1938, he obtained his PhD from the Department of Mathematics at Princeton University. During the Second World War, Turing worked for the Government Code and Cypher School (GC&CS) at Bletchley Park, Britain's codebreaking centre that produced Ultra intelligence. For a time he led Hut 8, the section that was responsible for German naval cryptanalysis. Here, he devised a number of techniques for speeding the breaking of German ciphers, including improvements to the pre-war Polish bombe method, an electromechanical machine that could find settings for the Enigma machine. Turing played a crucial role in cracking intercepted coded messages that enabled the Allies to defeat the Nazis in many crucial engagements, including the Battle of the Atlantic. Due to the problems of counterfactual history, it is hard to estimate the precise effect Ultra intelligence had on the war. However, Professor Jack Copeland has estimated that this work shortened the war in Europe by more than two years and saved over 14 million lives.After the war, Turing worked at the National Physical Laboratory, where he designed the Automatic Computing Engine (ACE), one of the first designs for a stored-program computer. In 1948, Turing joined Max Newman's Computing Machine Laboratory, at the Victoria University of Manchester, where he helped develop the Manchester computers and became interested in mathematical biology. He wrote a paper on the chemical basis of morphogenesis and predicted oscillating chemical reactions such as the Belousov–Zhabotinsky reaction, first observed in the 1960s. Despite these accomplishments, he was never fully recognised in his home country during his lifetime because much of his work was covered by the Official Secrets Act.
Turing was prosecuted in 1952 for homosexual acts; the Labouchere Amendment of 1885 had mandated that "gross indecency" was a criminal offence in the UK. He accepted chemical castration treatment, with DES, as an alternative to prison. Turing died in 1954, 16 days before his 42nd birthday, from cyanide poisoning. An inquest determined his death as a suicide, but it has been noted that the known evidence is also consistent with accidental poisoning.
In 2009, following an Internet campaign, British Prime Minister Gordon Brown made an official public apology on behalf of the British government for "the appalling way he was treated". Queen Elizabeth II granted Turing a posthumous pardon in 2013. The "Alan Turing law" is now an informal term for a 2017 law in the United Kingdom that retroactively pardoned men cautioned or convicted under historical legislation that outlawed homosexual acts. Turing has an extensive legacy with statues of him, many things named after him including an annual award for computer science innovations. He appears on the current Bank of England £50 note, which was released to coincide with his birthday. A 2019 BBC series, as voted by the audience, named him the greatest person of the 20th century.

View More On Wikipedia.org
  1. R

    Trying to generate Turing patterns for Brusselator equations

    so my project is on reaction diffusion equations in 2d. i have been asked to reproduce known and published work to start off with and the system is the brusselator equations with diffusion terms. to put it simply my program doesn't work. now the parameter values for the equations are taken from...
  2. B

    Turing machine and quantum computers

    Can anyone help me...from Nielsen-Chuang "quantum computation and quantum information":how might we recognize that a process in nature computes a function not computable by a turing machine?
  3. B

    Turing machine, computable function.

    From Nielsen-Chuang:how might we recognize that a process in nature computes a function not computable by a turing machine?
  4. haael

    Conciousness and Turing undecidability

    Hello, guys. I'm a dualist - that is, I believe that conciousness, thoughts and intelligence are not driven by material particles and laws of physics as we currently know. I also believe in God, for that matter. Now check this: physical world has its own "computational complexity class", i.e...
  5. M

    Optimizing Turing Machine Functions: Finding the Minimum Cost and Enumeration

    Hello smart people, I am wondering if there is a process to convert a function to a Turing Machine. In other words, if I provide a list of input strings , and a corresponding output string for each input string, is there a way to find the minimum number of instructions to realize any function...
  6. T

    Programming Binary Addition with a Turing Machine

    hello, One can wonder what is the relation between the title of this thread and the subject of quantum mechanics, well, i was reading in a book about quantum computation and information and it was talking about computer science in some chapter where it shows a basic understanding of Turing...
  7. I

    Boolean expressions for Turing Machine

    Hello, I want to express Non-Deterministic Turing Machine constraint with boolean expression. The constraint is: "Cells which aren’t being read remain the same at time t+1". lets say H[i,j] means the read/write head at time i at cell j and S[i,j,k] means the symbol k at time i in cell j so the...
  8. daniel_i_l

    Can I Build a Mechanical Turing Machine Using Everyday Materials?

    As a summer project I was thinking of building an entirely mechanical Turing machine - possibly with Lego. Has anyone attempted this? Does anyone have any advice on how to design this? Thanks.
  9. E

    Turing machines and decidability

    Okay, so if I have a turing machine so called M, is there a configuration alpha s beta which yields a configuration with state q? If it's decidable can someone explain the algorithm to proceed?
  10. C

    Turing Machine Help: Construct & Describe Work for Calculating Logic Expression

    Homework Statement I need to construct and describe work od Touring machine which will calculate the value of logical expression with Boolean operators AND and OR. The simbol of input track which match logic operator AND is *, and simbol od input track that match logic operator OR is +...
  11. C

    Complement of Universal Turing Machine - Does this exist?

    Complement of Universal Turing Machine - Does this exist?? I am kind of confused in terms of the creation of machine which does NOT (Universal Turing Machine). I mean I construct a TM which will simulate UTM and accept strings it rejects and rejects strings it accepts. So if L(UTM) defined as...
  12. D

    Uncountably Many Turing Machines

    This may be a bit vague, as I don't remember all the details. When proving Turing's halting problem, at some point you will say something along the lines of, "given a list of all Turing Machines, assume that there exists a Turing Machine M which decides whether machine A halts on input B". The...
  13. T

    Solving the Two-Dimensional Turing Machine Problem

    Homework Statement A two-dimensional Turing machine has the usual finite-state control but a tape that is a two-dimensional grid of cells, infinite in all directions. The input is placed on one row of the grid, with the head at the left end of the input and the control in the start state, as...
  14. Loren Booda

    Turing machine applied to virtual reality

    How can one readily determine that the reality one experiences is real, not virtual - perhaps through Turing machine logic?
  15. 0

    Can a PTM simulate a one-tape Turing machine in O(T^2) time?

    This was a bonus problem that I missed on the last homework. A paper tape Turing machine (PTM) is a Turing machine whose tape alphabet is partially ordered, and if a is a symbol on a square of the tape, then b can only be written on that square if b is greater than a in the partial order...
  16. P

    Understanding Turing Machines & Language Recognition

    Sorry if this is a wrong place to post this. What does it mean that a turing machine M recognize language A? Does it mean that A={w|M accepts w}? Is so then how does M accept w? Does it accept w if it ends in accept state?
Back
Top