Skip to search formSkip to main contentSkip to account menu

Entscheidungsproblem

Known as: Decision problem (logic), Entscheidungs Problem, Church's undecidability theorem 
In mathematics and computer science, the Entscheidungsproblem (pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm], German for 'decision problem') is a challenge… 
Wikipedia (opens in a new tab)

Related topics

Related topics

43 relations
AlgorithmAutomated theorem provingBoolean satisfiability problemChurch–Turing thesis

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On synthetic undecidability in Coq, with an application to the Entscheidungsproblem
We formalise the computational undecidability of validity, satisfiability, and provability of first-order formulas following a… 
Highly Cited
2005
Highly Cited
2005
Oblique Subjects: A Common Germanic Inheritance
We argue that subject-like obliques of the impersonal construction show behavioral properties of syntactic subjects in Old… 
Highly Cited
2004
Highly Cited
2004
Multiple Criteria Decision Making (MCDM)
Das Treffen richtiger Entscheidungen ist für den langfristigen Fortbestand eines Unternehmens von essentieller Bedeutung. Das… 
Highly Cited
2003
Highly Cited
2003
Computation beyond turing machines
Seeking appropriate methods to model computing and human thought. 
Highly Cited
1999
Highly Cited
1999
Business case Océ: Reverse logistic network re-design for copiers
Abstract. The introduction of extended producer responsibility forces Original Equipment Manufacturers to set up a logistic… 
Highly Cited
1991
Highly Cited
1991
Reconstruction of binary signals using an adaptive radial-basis-function equalizer
Highly Cited
1960
Highly Cited
1960
APPENDIX One (A) – On Computable Numbers, with an Application to the Entscheidungsproblem
Highly Cited
1938
Highly Cited
1938
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
In a paper entitled "On computable numbers, with an application to the Entscheidungsproblem"* the author gave a proof of the… 
Highly Cited
1937
Highly Cited
1937
On computable numbers, with an application to the Entscheidungsproblem
  • A. Turing
  • Proc. London Math. Soc.
  • 1937
  • Corpus ID: 73712
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable… 
Highly Cited
1936
Highly Cited
1936
A note on the Entscheidungsproblem
In a recent paper the author has proposed a definition of the commonly used term “effectively calculable” and has shown on the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)