Church-Turing thesis
Home
>
Languages
>
Formal Language
>
Recursively Enumerable Languages
>
Church-Turing thesis
The Church-Turing thesis states that any computable function can be computed using a Turing machine.