Linked from

The 17 pages that link to Entscheidungsproblem, each with the reason it gives.

• David HilbertRelated: Hilbert and Wilhelm Ackermann formulated this decision problem in 1928.

• Turing machineRelated: Turing used his machine analysis to show that no general solution exists.

• Alan TuringRelated: Turing proved that no general procedure can solve this decision problem.

• Halting problemRelated: Turing's work on computation showed that this decision challenge has no universal solution.

• Church–Turing thesisRelated: The search for a solution prompted formal investigations of effective procedures.

• Computability theoryRelated: Its negative solution helped establish the subject's central limits on algorithms.

• Alonzo ChurchRelated: Church proved that no general decision procedure exists for first-order logic.

• Kurt GödelRelated: Gödel’s work helped clarify the limits of formal proof that later undecidability results made explicit.

• Universal Turing machineRelated: Turing’s account of computation and universality helped establish that no such general decision procedure exists.

• Undecidable problemRelated: The negative solution established a prominent form of undecidability.

• Presburger arithmeticRelated: Presburger arithmetic provides a decidable fragment within the broader search for such procedures.

• Hilbert's tenth problemRelated: It reflects the broader early twentieth-century search for general decision procedures.

• Hilbert's problemsRelated: Its eventual negative solution echoed the limits of algorithmic methods raised by Hilbert's challenges.

• Church–Rosser theoremRelated: The theorem arose within the logical investigations surrounding this problem.

• Formal scienceRelated: Its negative resolution exposed a boundary on mechanical proof checking.

• Theoretical computer scienceRelated: Its negative solution helped define computability as a mathematical subject.

• Turing's proofBroader topic: Turing’s undecidability result supplies one half of the negative solution to this problem.