The Church-Turing thesis is named after mathematicians alonzo church and alan turing in the field of computer science. The most basic idea of this topic is that all calculations or algorithms can be executed by Turing machine. Computer programs written in any conventional programming language can be translated into Turing machines, and conversely, any Turing machine can also be translated into most programming language programs, so this topic is equivalent to the following statement: a conventional programming language can effectively express any algorithm. This proposition is generally assumed to be true, also known as the Church proposition or Church conjecture and Turing proposition.

This topic has many possible meanings:

The universe is a Turing machine (therefore, it is physically impossible to calculate non-recursive functions). This is defined as the topic of the Great Church Turing.

The universe is not a Turing machine (that is, the laws of physics are not Turing computable), but countless physical events can't stop us from creating a supercomputer. For example, a universe with physical real numbers as computable real numbers can be classified in this way.

The universe is a supercomputer, because physical devices can be built to control this characteristic and calculate non-recursive functions. For example, an unsolved problem is that quantum mechanical events are Turing computable, although we have proved that any system composed of qubits is Turing complete. John lucas (and Roger Luo Ze) once suggested that the human brain may be the result of quantum supercomputing.