Everything About ___
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

  1. Read the overview: EntscheidungsproblemA 5-minute orientation
  2. 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
  3. Pick up a classic book: Frontiers of combining systemsThe most-reprinted book on the subject
  4. Read the landmark paper: On Computable Numbers, with an Application to the EntscheidungsproblemCited 2,890 times
  5. Go sideways: SatisfiabilityA closely related topic
  6. Go sideways: MetamathematicsA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics