Church's thesis is an informal statement that any algorithmic process can be expressed in terms of lambda calculus.