In mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed...

computation in general—and in particular, the uncomputability of the Entscheidungsproblem ('decision problem'). Turing machines proved the existence of fundamental...

Application to the Entscheidungsproblem". It was the second proof (after Church's theorem) of the negation of Hilbert's Entscheidungsproblem; that is, the...

is white. The Entscheidungsproblem (German for 'decision problem') is a challenge posed by David Hilbert in 1928. The Entscheidungsproblem asks for an algorithm...

calculus, the Church–Turing thesis, proving the unsolvability of the Entscheidungsproblem ("decision problem"), the Frege–Church ontology, and the Church–Rosser...

theorems. Church and Turing independently demonstrated that Hilbert's Entscheidungsproblem (decision problem) was unsolvable, thus identifying the computational...

Turing's 1937 proof, On Computable Numbers, with an Application to the Entscheidungsproblem, demonstrated that there is a formal equivalence between computable...

in 1946. Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Let A {\displaystyle...

One of the important problems for logicians in the 1930s was the Entscheidungsproblem of David Hilbert and Wilhelm Ackermann, which asked whether there...

#3: Was mathematics decidable? The third question is known as the Entscheidungsproblem (Decision Problem). 1930 (1930): Kurt Gödel announces a proof as...

1936 entitled On Computable Numbers, with an Application to the Entscheidungsproblem, which was published in the Proceedings of the London Mathematical...

seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Common sense might say that a universal machine is impossible,...

A. M. (1937). "On Computable Numbers, with an Application to the Entscheidungsproblem". Proceedings of the London Mathematical Society. 2. 42 (1): 230–265...

Turing's paper "On Computable Numbers, with an Application to the Entscheidungsproblem". The book takes readers sentence by sentence through Turing's paper...

the modern concept of algorithms began with attempts to solve the Entscheidungsproblem (decision problem) posed by David Hilbert. Later formalizations were...

incompleteness theorems - in 1931, Gödel independently demonstrated that the Entscheidungsproblem is not effectively decidable. This result showed that there is no...

publication called "On Computable Numbers, with an Application to the Entscheidungsproblem". It was published in the Proceedings of the London Mathematical...

reals, etc. are definable. Berry's paradox Constructible universe Entscheidungsproblem Ordinal definable set Richard's paradox Tarski's undefinability theorem...

Gödel's first incompleteness theorem and Turing's solution to the Entscheidungsproblem. It was first proven by William Lawvere in 1969. Lawvere's theorem...

the formal undefinability of truth, Church's proof that Hilbert's Entscheidungsproblem is unsolvable, and Turing's theorem that there is no algorithm to...

Alan M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2, vol. 42 (published...

validity problem was posed firstly by David Hilbert, as the so-called Entscheidungsproblem. The universal validity of a formula is a semi-decidable problem...

first of Gödel's incompleteness theorems and Turing's answer to the Entscheidungsproblem. Diagonalization arguments are often also the source of contradictions...

The halting problem was the first such set to be constructed. The Entscheidungsproblem, proposed by David Hilbert, asked whether there is an effective procedure...

logic, and posed the problem of its completeness and decidability (Entscheidungsproblem). Ackermann went on to construct consistency proofs for set theory...

include: Post correspondence problem Mortality (computability theory) Entscheidungsproblem Recursively enumerable languages (REL) are closed under the following...

Turing, 1937, On Computable Numbers, with an Application to the Entscheidungsproblem, pp. 116ff, with brief commentary by Davis on page 115. Alan Turing...

Alan M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2, vol. 42, no...

board (but with unlimited time) are undecidable. Philosophy portal Entscheidungsproblem Existential quantification Trakhtenbrot, 1953 . Monk, Donald (1976)...

A.M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2, vol. 42 (published...