A surname of Germanic origin. / Alan Turing (1912–1954), a British logician and early computer scientist. / (computing) A programming language (named after Alan Turing).

(computing theory) An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state.

(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.

(computing) The situation in which a programming language is only minimally Turing complete, so that "everything is possible but nothing is easy".

plural of Turing test

(artificial intelligence) A test of a computer's ability to demonstrate intelligence, as measured by whether a human judge can reliably distinguish the computer from another human being by conversing with both entities in natural, but written only, language over a terminal.

Alternative spelling of Turing complete.

(computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number.

plural of Turing jump

(computing theory) In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X.