Church-Turing Thesis

A fundamental thesis in computability theory holding that any function computable by an effective method can be computed by a Turing machine, thereby binding algorithms to definite mechanical steps.