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 com ...

(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 th ...

, 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 Stringe ...

Brighton,England * The Turing School, Eastbourne, England *

Alan Turing Centenary Conference The Alan Turing Centenary Conference was an academic conference celebrating the life and research of Alan Turing by bringing together distinguished scientists to understand and analyse the history and development of Computer Science and Artifici ...

, 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 ...

, 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 outlawe ...

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 convicted ...

, 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 Alan Turing Year, 2012, marked the celebration of the life and scientific influence of Alan Turing during the centenary of his birth on 23 June 1912. Turing had an important influence on computing, computer science, artificial intelligence, ...

*''

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 comp ...

Church–Turing–Deutsch principle In computer science and quantum physics, the Church–Turing–Deutsch principle (CTD principle) is a stronger, physical form of the Church–Turing thesis formulated by David Deutsch in 1985. The principle states that a universal computing d ...

* Good–Turing frequency estimation *

Object-Oriented Turing Turing is a high-level programming language, high-level, general-purpose programming language developed in 1982 by Ric Holt and James Cordy, at University of Toronto in Ontario, Canada. It was designed in order to help students taking their firs ...

(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 * Turing computability * Turing degree *

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 acquired ...

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

Turing Institute The Turing Institute was an artificial intelligence laboratory in Glasgow, Scotland, between 1983 and 1994. The company undertook basic and applied research, working directly with large companies across Europe, the United States and Japan devel ...

, Glasgow, Scotland *

Turing jump In computability theory, the Turing jump or Turing jump operator, named for Alan Turing, is an operation that assigns to each decision problem a successively harder decision problem with the property that is not decidable by an oracle machine w ...

Turing Lecture The Turing Talk, previously known as the Turing Lecture, is an annual award lecture delivered by a noted speaker on the subject of Computer Science. Sponsored and co-hosted by the Institution of Engineering and Technology (IET) and the British Com ...

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 algori ...

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 and co-NP. ...

Multi-track Turing machine A Multitrack Turing machine is a specific type of multi-tape Turing machine. In a standard n-tape Turing machine, n heads move independently along n tracks. In a n-track Turing machine, one head reads and writes on all tracks simultaneously. ...

** Multitape Turing machine **

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 ** Post–Turing machine ** Probabilistic Turing machine **

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 A read-only Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape. Th ...

** Symmetric Turing machine **

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 ** 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 is the codename for a graphics processing unit (GPU) microarchitecture developed by Nvidia. It is named after the prominent mathematician and computer scientist Alan Turing. The architecture was first introduced in August 2018 at SIGGRAPH ...

* 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 Vyera Pharmaceuticals (formerly Turing Pharmaceuticals) is a pharmaceutical company incorporated in Zug, Switzerland, with offices in New York City. The company started to do business in the US as Vyera Pharmaceuticals in September 2017. The com ...

Turing (programming language) Turing is a high-level, general-purpose programming language developed in 1982 by Ric Holt and James Cordy, at University of Toronto in Ontario, Canada. It was designed in order to help students taking their first computer science course learn ...

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

Turing switch In theoretical network science, the Turing switch is a logical construction modeling the operation of the network switch, just as in theoretical computer science a Turing machine models the operation of a computer. Both are named in honor of the E ...

* 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 1982 ...

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

** 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. T ...

Subject matter expert Turing test A subject matter expert Turing test is a variation of the Turing test where a computer system attempts to replicate an expert in a given field such as chemistry or marketing. It is also known as a Feigenbaum test and was proposed by Edward Feigenba ...

** Visual Turing Test *''

The 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 evaluato ...

'' (novel) *''

'' (video game) * The Turing Trust *Turing from 2064: Read Only Memories (video game) *

Turing's method In mathematics, Turing's method is used to verify that for any given Gram point there lie ''m'' + 1 zeros of , in the region , where is the Riemann zeta function. It was discovered by Alan Turing Alan Mathison Turing (; 23 Jun ...

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+ Turing is a high-level, general-purpose programming language developed in 1982 by Ric Holt and James Cordy, at University of Toronto in Ontario, Canada. It was designed in order to help students taking their first computer science course learn ...

(programming language) * Turing.jl (probabilistic programming) * Turingery * Turingismus *

Turmite In computer science, a turmite is a Turing machine which has an orientation in addition to a current state and a "tape" that consists of an infinite two-dimensional grid of cells. The terms ant and vant are also used. Langton's ant is a well-kn ...

Turochamp ''Turochamp'' is a computer chess, chess program developed by Alan Turing and D. G. Champernowne, David Champernowne in 1948. It was created as part of research by the pair into computer science and machine learning. ''Turochamp'' is capable of ...

References

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

See also

References