Difference between revisions of "Church–Turing thesis"

Latest revision as of 21:34, 3 September 2016

In computability theory, the Church–Turing thesis (also known as the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis ("thesis") about the nature of computable functions.

Description

In simple terms, the Church–Turing thesis states that a function on the natural numbers is computable in an informal sense (i.e., computable by a human being using a pencil-and-paper method, ignoring resource limitations) if and only if it is computable by a Turing machine.

The thesis is named after American mathematician Alonzo Church and the British mathematician Alan Turing.

History

Before the precise definition of computable function, mathematicians often used the informal term effectively calculable to describe functions that are computable by paper-and-pencil methods.

In the 1930s, several independent attempts were made to formalize the notion of computability.

In 1933, Austrian-American mathematician Kurt Gödel, with Jacques Herbrand, created a formal definition of a class called general recursive functions. The class of general recursive functions is the smallest class of functions (possibly with more than one argument) which includes all constant functions, projections, the successor function, and which is closed under function composition and recursion.

In 1936, Alonzo Church created a method for defining functions called the λ-calculus. Within λ-calculus, he defined an encoding of the natural numbers called the Church numerals. A function on the natural numbers is called λ-computable if the corresponding function on the Church numerals can be represented by a term of the λ-calculus.

Also in 1936, before learning of Church's work, Alan Turing created a theoretical model for machines, now called Turing machines, that could carry out calculations from inputs by manipulating symbols on a tape. Given a suitable encoding of the natural numbers as sequences of symbols, a function on the natural numbers is called Turing computable if some Turing machine computes the corresponding function on encoded natural numbers.

Results

Church and Turing proved that these three formally defined classes of computable functions coincide:

• a function is λ-computable if and only if it is Turing computable if and only if it is general recursive.

This has led mathematicians and computer scientists to believe that the concept of computability is accurately characterized by these three equivalent processes.

Cannot be formally proven

On the other hand, the Church–Turing thesis states that the above three formally-defined classes of computable functions coincide with the informal notion of an effectively calculable function.

Since, as an informal notion, the concept of effective calculability does not have a formal definition, the thesis, although it has near-universal acceptance, cannot be formally proven.

Variations

Since its inception, variations on the original thesis have arisen, including statements about what can physically be realized by a computer in our universe (Physical Church-Turing Thesis) and what can be efficiently computed (Complexity-Theoretic Church–Turing Thesis).

These variations are not due to Church or Turing, but arise from later work in complexity theory and digital physics.

The thesis also has implications for the philosophy of mind.

See also

• Alan Turing
• Alonzo Church
• Computable function
• Effective calculability
• Lambda calculus
• Mathematical universe hypothesis
• Turing completeness
• Turing machine

External links

• Church–Turing thesis @ Wikipedia