the Church-Turing Thesis states that “Any problem that can be solved by an algorithm can be solved by some Turing machine and any algorithmic computation can be done by some Turing machine” Church 1936.

http://plato.stanford.edu/entries/church-turing/