The MathResource
computability theory,
n. the study of algorithms, and in particular their power and limitations, often conceived of in terms of turing machines. This grew out of Hilbert's program, which was ultimately proved impossible by Gödel's theorem. See also Church's thesis, automata theory.