The Church-Turing thesis states that for every algorithm, its function from inputs to outputs can be recognized by a Turing machine.
Info
We assume that the Turing machine and the algorithm share the same halting conditions and behavior.
This means Turing machines are a precise formal equivalent of the intuitive notion of “algorithm”. Any computational problem that can be solved in a general purpose programming language is also solvable by a Turing machine.