Live briefing
Everything about Entscheidungsproblem
Impossible task in computing
In mathematics and computer science, the Entscheidungsproblem is a challenge posed by David Hilbert and Wilhelm Ackermann in 1928. It asks for an algorithm that considers an input statement and answers "yes" or "no" according to whether it is universally valid, i.e., valid in every structure. Such an algorithm was proven to be impossible by Alonzo Church and Alan Turing in 1936. Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: EntscheidungsproblemA 5-minute orientation
- Skim a recent paper: Reflections on the Russian Translation of A.M. Turing’s Paper “On Computable Numbers, with an Application to the Entscheidungsproblem”Influential work since 2022
- Pick up a classic book: Frontiers of combining systemsThe most-reprinted book on the subject
- Read the landmark paper: On Computable Numbers, with an Application to the EntscheidungsproblemCited 2,890 times
- Go sideways: SatisfiabilityA closely related topic
- Go sideways: MetamathematicsA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
On Computable Numbers, with an Application to the Entscheidungsproblem
A note on the Entscheidungsproblem
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem
Zum Entscheidungsproblem der mathematischen Logik
ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
Turing-machines and the Entscheidungsproblem
Zum Entscheidungsproblem des logischen FunktionenkalkĂĽls
🆕 Influential since 2022
📚 Books worth reading
Frontiers of combining systemsFroCoS 2002 (2002 Santa Margherita Ligure, Italy) · 2002
Frontiers of Combining SystemsBernhard Gramlich · 2005
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Satisfiability In mathematical logic, a formula is satisfiable if it is true under some assignment of values to its variables. For example, the formula x + 3 = y {\displaystyl…
- Metamathematics Metamathematics is the study of mathematics itself using mathematical methods. This study produces metatheories, which are mathematical theories about…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Timeline of mathematical logic A timeline of mathematical logic; see also history of logic. 1847 – George Boole proposes symbolic logic in The Mathematical Analysis of Logic, defining…
- History of the Church–Turing thesis The history of the Church–Turing thesis ("thesis") involves the history of the development of the study of the nature of functions whose values are effectively…
- List of mathematical logic topics This is a list of mathematical logic topics. For traditional syllogistic logic, see the list of topics in logic. See also the list of computability and…
- Church–Turing thesis In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers…
- Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table…