Editing Entscheidungsproblem (section)

{{short description|Impossible task in computing}}
{{italic title}}
{{Use dmy dates|date=August 2021}}
In [[mathematics]] and [[computer science]], the {{lang for|de|'''Entscheidungsproblem'''|decision problem|paren=left}}; {{IPA|de|ɛntˈʃaɪ̯dʊŋspʁoˌbleːm|pron}}) is a challenge posed by [[David Hilbert]] and [[Wilhelm Ackermann]] in 1928.<ref>David Hilbert and Wilhelm Ackermann. Grundzüge der Theoretischen Logik. Springer, Berlin, Germany, 1928. English translation: David Hilbert and Wilhelm Ackermann. Principles of Mathematical Logic. AMS Chelsea Publishing, Providence, Rhode Island, USA, 1950</ref> It asks for an [[algorithm]] that considers an inputted statement and answers "yes" or "no" according to whether it is universally valid, i.e., valid in every [[Structure (mathematical logic)|structure]]. Such an algorithm was proven to be impossible by [[Alonzo Church]] and [[Alan Turing]] in 1936.