Alan Turing 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 ...

(1912–1954), a pioneer computer scientist, mathematician, and philosopher, is the

eponym An eponym is a person, a place, or a thing after whom or which someone or something is, or is believed to be, named. The adjectives which are derived from the word eponym include ''eponymous'' and ''eponymic''. Usage of the word The term ''epon ...

of all of the things (and topics) listed below. *

Alan Turing Building The Alan Turing Building, named after the mathematician and founder of computer science Alan Turing, is a building at the University of Manchester, in Manchester, England. It houses the School of Mathematics, the Photon Science Institute and ...

, Manchester, England *Turing School/house

Varndean School Varndean School is a secondary school serving a large area of Brighton, England. In 2013, 2017 and 2022, Ofsted inspectors described Varndean as a 'Good' school. Varndean shares the Surrenden Campus with Balfour Primary School, Dorothy String ...

Brighton,England * The Turing School, Eastbourne, England * Alan Turing Centenary Conference, Manchester, England *

Alan Turing Institute The Alan Turing Institute is the United Kingdom's national institute for data science and artificial intelligence, founded in 2015 and largely funded by the UK government. It is named after Alan Turing, the British mathematician and computing p ...

, London, England *

Alan Turing law The "Alan Turing law" is an informal term for the law in the United Kingdom, contained in the Policing and Crime Act 2017, which serves as an amnesty law to pardon men who were cautioned or convicted under historical legislation that outlaw ...

Alan Turing Memorial The ''Alan Turing Memorial'', situated in Sackville Gardens in Manchester, England, is a sculpture in memory of Alan Turing, a pioneer of modern computing. Turing is believed to have taken his own life in 1954, two years after being convic ...

, Manchester, England * Alan Turing sculpture, Eugene, Oregon, United States *

Alan Turing statue A statue of Alan Turing, created in slate by Stephen Kettle in 2007, is located at Bletchley Park in England as part of an exhibition that honours Turing (1912–1954). It was commissioned by the American businessman and philanthropist Sidney F ...

, Bletchley Park, England *'' Alan Turing: The Enigma'' * Alan Turing Year *''

The Annotated Turing ''The Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and the Turing Machine'' is a book by Charles Petzold, published in 2008 by John Wiley & Sons, Inc. Petzold annotates Alan Turing's paper "On Computab ...

'' *

Church–Turing thesis In computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a thesis about the nature of co ...

* Church–Turing–Deutsch principle * Good–Turing frequency estimation * Object-Oriented Turing (programming language) * Super-Turing computation * Turing-acceptable language *

Turing Award The ACM A. M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) for contributions of lasting and major technical importance to computer science. It is generally recognized as the highest distinction in compu ...

* Turing (cipher) * Turing College, Kent, England *

Turing completeness In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Tu ...

* Turing computability *

Turing degree In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. Overview The concept of Turing degree is fund ...

Turing Foundation The Turing Foundation is a Dutch charitable organization, based in Amsterdam, The Netherlands. The Turing Foundation, named in honour of scientist Alan Turing, was established in 2006 by Pieter Geelen, who donated the €100 million he acquire ...

, Amsterdam, Netherlands * Turing Gateway to Mathematics, Cambridge, England *'' The Turing Guide'' *

Turing House School Turing House School is a co-educational comprehensive secondary school which was opened in 2015 in the London Borough of Richmond, south-west London, under the Government's free schools initiative. The proposal for the school was initiated b ...

* Turing Institute, Glasgow, Scotland * Turing jump * Turing Lecture *

Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer alg ...

Alternating Turing machine In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP (complexity ...

** Multi-track Turing machine **

Multitape Turing machine A multi-tape Turing machine is a variant of the Turing machine that utilizes several tapes. Each tape has its own head for reading and writing. Initially, the input appears on tape 1, and the others start out blank. This model intuitively seems m ...

Neural Turing machine A Neural Turing machine (NTM) is a recurrent neural network model of a Turing machine. The approach was published by Alex Graves et al. in 2014. NTMs combine the fuzzy pattern matching capabilities of neural networks with the algorithmic power of ...

Non-deterministic Turing machine In theoretical computer science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is ''not'' comp ...

Post–Turing machine A Post–Turing machineRajendra Kumar, ''Theory of Automata'', Tata McGraw-Hill Education, 2010, p. 343. is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation. Post's mode ...

Probabilistic Turing machine In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution. As a consequence, a probabilistic Turi ...

Quantum Turing machine A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple model that captures all of the power of quantum computation—that is, any quantum algori ...

Read-only right moving Turing machines In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automa ...

** Read-only Turing machine **

Symmetric Turing machine A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i). Definition of symmetric Turing machines Formally, we define a var ...

Unambiguous Turing machine In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. An unambiguous Turing machine is a special kind of non-deterministic Turing machi ...

Universal Turing machine In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of the machine to be simu ...

** Wolfram's 2-state 3-symbol Turing machine *

Turing Machine (band) Turing Machine is an American instrumental rock band formed in New York City, United States, in 1998 by Justin Chearno and Scott DeSimon, late of DC's noise-rockers Pitchblende and Gerhardt 'Jerry' Fuchs, who had moved to New York to play with B ...

* Turing (microarchitecture) * Turing OS *

Turing pattern The Turing pattern is a concept introduced by English mathematician Alan Turing in a 1952 paper titled "The Chemical Basis of Morphogenesis" which describes how patterns in nature, such as stripes and spots, can arise naturally and autonomousl ...

* Turing Pharmaceuticals * Turing (programming language) *

Turing reduction In computability theory, a Turing reduction from a decision problem A to a decision problem B is an oracle machine which decides problem A given an oracle for B (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to s ...

* Turing Robot, China * Turing scheme *Turing Street - A road in East London * Turing switch * Turing table *

Turing tarpit A Turing tarpit (or Turing tar-pit) is any programming language or computer interface that allows for flexibility in function but is difficult to learn and use because it offers little or no support for common tasks. The phrase was coined in 198 ...

Turing test The Turing test, originally called the imitation game by Alan Turing in 1950, is a test of a machine's ability to exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human. Turing proposed that a human evaluat ...

** Computer game bot Turing Test ** Graphics Turing Test **

Reverse Turing test A Reverse Turing test is a Turing test in which the objective or roles between computers and humans have been reversed. Conventionally, the Turing test is conceived as having a human judge and a computer subject which attempts to appear human. ...

** Subject matter expert Turing test ** Visual Turing Test *'' The Turing Test'' (novel) *'' The Turing Test'' (video game) * The Turing Trust *Turing from 2064: Read Only Memories (video game) * Turing's method *

Turing's proof Turing's proof is a proof by Alan Turing, first published in January 1937 with the title "On Computable Numbers, with an Application to the ". It was the second proof (after Church's theorem) of the negation of Hilbert's ; that is, the conjecture ...

* Turing's Wager * Turing+ (programming language) * Turing.jl (probabilistic programming) *

Turingery Turingery in ''Testery Methods 1942–1944'' or Turing's method (playfully dubbed Turingismus by Peter Ericsson, Peter Hilton and Donald Michie) was a manual codebreaking method devised in July 1942 by the mathematician and cryptanalyst Alan Turi ...

* Turingismus * Turmite *

Turochamp ''Turochamp'' is a chess program developed by Alan Turing and David Champernowne in 1948. It was created as part of research by the pair into computer science and machine learning. ''Turochamp'' is capable of playing an entire chess game agai ...

References

{{DEFAULTSORT:Things named after Alan Turing Turing, Alan Turing, Alan *Things named after Alan Turing

See also

References