Thesis that whatever can be expressed by a Turing machine — or by its equivalents, lambda calculus and partially recursive functions — is what can be mathematically computed. Consequence: a problem a Turing machine cannot compute need not be run; it must instead be proven unsolvable within current mathematics or algorithms.