Church-Turing thesis

Home > Philosophy > Deconstruction > Undecidability > Church-Turing thesis

The hypothesis that any function computable by an algorithm can be computed by a Turing machine, and vice versa.