Turingery

Alternative spelling of Turing complete.

plural of Turing degree

(computing theory) A reduction that solves a problem if the solution to another problem is already known, i.e. an algorithm that could be used to solve A if it had available to it a subroutine for solving B.

plural of Turing reduction

A logical construction modelling the operation of the network switch, just as in theoretical computer science a Turing machine models the operation of a computer.

plural of Turing switch

(computing theory) The infinitely long memory tape on which a Turing machine would operate, consisting of individual cells that can be read or written.

plural of Turing tape

(computing theory) A hypothesis about the nature of computable functions, stating that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine.