Entscheidungsproblem
Impossible task in computing / From Wikipedia, the free encyclopedia
In mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed by David Hilbert and Wilhelm Ackermann in 1928.[1] The problem asks for an algorithm that considers, as input, a statement and answers "yes" or "no" according to whether the statement is universally valid, i.e., valid in every structure.