His articulation of what has come to be known as the Church-Turing thesis.

This would, however, be in contradiction with the Church-Turing thesis.

Others suggest it is little more than a rechristening of the Church-Turing thesis.

Indeed, this is the statement of the Church-Turing thesis.

According to the Church-Turing thesis, both models can express any possible computation.

Because these three properties are not formally stated, the Church-Turing thesis cannot be proved.

The Church-Turing thesis says nothing about the efficiency with which one model of computation can simulate another.

The existence of "standard" quantum computers does not disprove the Church-Turing thesis.

This has been termed the Strong Church-Turing thesis and is a foundation of digital physics.

According to the Church-Turing thesis, there is no effective procedure (with an algorithm) which can perform these computations.

The Church-Turing thesis in recursion theory relies on a particular definition of the term algorithm.

There are also some important open questions which cover the relationship between the Church-Turing thesis and physics, and the possibility of hypercomputation.

This resulted in the Church-Turing thesis.

These topics are covered by what is now called the Church-Turing thesis, a hypothesis about the nature of mechanical calculation devices, such as electronic computers.

The success of the Church-Turing thesis prompted variations of the thesis to be proposed.

In a theoretical sense, the Church-Turing thesis implies that any operating environment can be emulated within any other.

The Church-Turing thesis states that all computers are only as powerful as Turing machines.

See Church-Turing thesis.

The Church-Turing thesis is similar to Gödel's incompleteness theorems.

This interpretation of the Church-Turing thesis differs from the interpretation commonly accepted in computability theory, discussed above.

This is one of the many ways to define computability; see the Church-Turing thesis for a discussion of other approaches and their equivalence.

While mechanically simple, the Church-Turing thesis implies that a Turing machine can solve any "reasonable" problem.

Defining what such game-playing machines mean, computability logic provides a generalization of the Church-Turing thesis to the interactive level.

The famous Church-Turing thesis attempts to define computation and computability in terms of Turing machines.

According to the Church-Turing thesis, a Turing reduction is the most general form of an effectively calculable reduction.