Church–Turing Thesis

An informal foundational claim that any function which can be computed by a finite, mechanical procedure (an effective algorithm) can be computed by a Turing machine; it identifies Turing-computability with the intuitive notion of algorithmic computability.