Church–Turing thesis
= Church–Turing thesis
{c}
{wiki}
The Church–Turing thesis asserts that every effectively calculable function is computable by a formal model equivalent to a <Turing machine>. It identifies an informal notion of effective procedure with a mathematical class rather than stating a theorem within one formal system.