The thesis that every effectively computable function is general recursive. A thesis rather than a theorem, because the notion of effective computability remains intuitive rather than mathematically defined. The thesis is generally believed, since a number of notions, including Turing computability, coincide in identifying this class of functions, and nobody has yet found something that is effective, intuitively, but not recursive.