Linked from

The 28 pages that link to Church–Turing thesis, each with the reason it gives.

• Turing machineRelated: It connects this formal model to the informal idea of an algorithm.

• Gödel's incompleteness theoremsRelated: Gödel's work on undecidability prepared the ground for the formal theory of computation.

• Alan TuringRelated: It links Turing’s formal machine to the intuitive idea of an algorithm.

• Halting problemRelated: It connects the formal machine result to the broader notion of algorithmic solvability.

• Computability theoryRelated: It connects formal models to the informal idea of an algorithm.

• Alonzo ChurchRelated: Church and Alan Turing independently identified the same boundary of effective computation.

• Lambda calculusRelated: Lambda calculus became one of the formal models used to characterize effective computation.

• Formal systemRelated: It connects formal rule-following to the limits of mechanical computation.

• EntscheidungsproblemRelated: It connects the machine-based impossibility proof to the broader notion of an algorithm.

• Computable functionRelated: It connects the informal idea of an effective procedure to formal models of computation.

• Formal logicRelated: It links formal procedures for reasoning with the mathematical theory of computation.

• Foundations of mathematicsRelated: It links formal reasoning to a precise account of what can be computed mechanically.

• Universal Turing machineRelated: A universal machine makes the Turing model a single framework for representing arbitrary algorithms.

• Deterministic algorithmRelated: It connects informal algorithms to precise models of computation.

• Quantum information scienceRelated: The extended thesis about efficient computation motivates comparisons between classical and quantum computers.

• Computational theory of mindRelated: Its scope bears on whether formal computation can capture every process attributed to thought.

• Undecidable problemRelated: It connects formal undecidability results to the intuitive notion of algorithm.

• Nondeterministic Turing machineRelated: Nondeterministic and deterministic machines compute the same class of functions despite different resource costs.

• Church–Rosser theoremRelated: The theorem's historical setting was the same effort to formalize computation.

• Formal scienceRelated: It links informal notions of calculation to a precise formal model.

• Computably enumerable setRelated: It connects algorithmic listings to the formal computability framework.

• General recursive functionRelated: The equivalence between general recursion and computation supports this identification of effective calculability.

• Theory of computationRelated: It links the mathematical machine model to the informal idea of an algorithm.

• Gödel's first incompleteness theoremRelated: Connects effective axiomatizability in the theorem to the precise notion of computation.

• History of computer scienceRelated: It linked independent formal definitions of computation to a common account of algorithmic calculability.

• Model of computationRelated: It connects several formal models to the intuitive notion of an algorithm.

• Turing's proofRelated: It connects Turing’s formal impossibility result to the broader notion of an effective decision procedure.