Turing Number — Pour les articles homonymes, voir Turing (homonymie). Un turing number est une image contenant un code difficile à lire, que l utilisateur doit entrer pour valider un formulaire, ce qui permet d empêcher un robot de soumettre le formulaire. Voir… … Wikipédia en Français
Turing — may refer to:*Alan Turing, after whom the items listed below are ultimately named*Turing (programming language) *Turing (cipher) *Turing completeness *Turing machine *Turing Number *Turing test *Reverse Turing test *Turing Award *Turing Police… … Wikipedia
Turing — (homonymie) Cette page d’homonymie répertorie les différents sujets et articles partageant un même nom. Alan Mathison Turing était un mathématicien et informaticien anglais, considéré comme l « inventeur » de l ordinateur. Son nom est… … Wikipédia en Français
Turing (homonymie) — Cette page d’homonymie répertorie les différents sujets et articles partageant un même nom. Alan Mathison Turing était un mathématicien et informaticien anglais, considéré comme l « inventeur » de l ordinateur. Son nom est fréquemment… … Wikipédia en Français
Turing machine equivalents — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Turing (programming language) — Turing is a Pascal like programming language developed in 1982 by Ric Holt and James Cordy, then of University of Toronto, Canada. Turing is a descendant of Euclid, Pascal and SP/k that features a clean syntax and precise machine independent… … Wikipedia
Turing machine — n. [after TURING Alan Mathison, its originator] an early hypothetical model for a simple computer capable theoretically of solving complex problems by performing a small number of basic operations … English World dictionary
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Turing reduction — In computability theory, a Turing reduction from a problem A to a problem B, named after Alan Turing, is a reduction which solves A, assuming B is already known (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to … Wikipedia
