Church-Turing Thesis

The Church-Turing Thesis states that any language that can be effectively computed by some finite process ($\lambda$-computable) can be recognised by a Turing machine.