Noun
Entscheidungsproblem
(mathematics, logic) A decision problem of finding a way to decide whether a formula is true or provable within a given system.
Church and Turing independently demonstrated that Hilbert's Entscheidungsproblem (decision problem) was unsolvable, citation thus identifying the computational core of the incompleteness theorem. Source: Internet
Feferman 1999, p. 1 Alonzo Church and Alan Turing proposed formal models of computability, giving independent negative solutions to Hilbert's Entscheidungsproblem in 1936 and 1937, respectively. Source: Internet
Entscheidungsproblem (decision problem) was originally posed by German mathematician David Hilbert in 1928. Source: Internet
The Entscheidungsproblem asked for a procedure that, given any formal mathematical statement, would algorithmically determine whether the statement is true. Source: Internet
The first results about unsolvability, obtained independently by Church and Turing in 1936, showed that the Entscheidungsproblem is algorithmically unsolvable. Source: Internet
Effective calculability: In an effort to solve the Entscheidungsproblem defined precisely by Hilbert in 1928, mathematicians first set about to define what was meant by an "effective method" or "effective calculation" or "effective calculability" (i. Source: Internet