Church-Turing thesis

The Church-Turing thesis (also known as Church's thesis, Church's conjecture and Turing's thesis) is a statement about computers. It says that a very simple kind of computer now named a “Turing machine” is able to do what any computer is able to do. The Church-Turing thesis is similar to Gödel's incompleteness theorems. When a computer is able to do what a Turing machine can do, that computer is Turing complete.