(mathematics) Any function whose value may be computed using a Turing machine.

plural of universal Turing machine

plural of Turing computable function

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

(cryptography) A manual cryptanalysis technique used in breaking the Lorenz cipher during World War II, based on deducing the wheel settings of the machine that did the encryption.

Turingery