The Church-Turing Thesis is a hypothesis that any function that can be computed by an algorithm can be computed by a Turing Machine. It is a central concept of computability theory.
The Church-Turing Thesis is a hypothesis that any function that can be computed by an algorithm can be computed by a Turing Machine. It is a central concept of computability theory.