Church–Turing thesis
In constructive mathematics, Church's thesis (CT) is an axiom stating that all total functions are computable. The axiom takes its name from the Church–Turing thesis, which states that every effectively calculable function is a computable function, but the constructivist version is much stronger, claiming that every function is computable.