# Church-Turing Thesis

The intuitive notion of algorithms is equal to the algorithms that can be represented using Lambda Calculus/Lambda Calculus/Turing Machine.

In Computability Theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine.