Church-Turing Thesis

The Church-Turing Thesis states the extensional equivalence of several different methods of formalizing the notion of computability (for example, any general recursive function can be computed by a Turing Machine) and thus conjectures that the informal notion of computability captures a well-defined set of functions.