Entscheidungsproblem
In mathematics and computer science, the Entscheidungsproblem (pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm], German for 'decision problem') is a challenge posed by David Hilbert in 1928. The Entscheidungsproblem asks for an algorithm that takes as input a statement of a first-order logic (possibly with a finite number of axioms beyond the usual axioms of first-order logic) and answers "Yes" or "No" according to whether the statement is universally valid, i.e., valid in every structure satisfying the axioms. By the completeness theorem of first-order logic, a statement is universally valid if and only if it can be deduced from the axioms, so the Entscheidungsproblem can also be viewed as asking for an algorithm to decide whether a given statement is provable from the axioms using the rules of logic.
notableIdea
primaryTopic
Entscheidungsproblem
In mathematics and computer science, the Entscheidungsproblem (pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm], German for 'decision problem') is a challenge posed by David Hilbert in 1928. The Entscheidungsproblem asks for an algorithm that takes as input a statement of a first-order logic (possibly with a finite number of axioms beyond the usual axioms of first-order logic) and answers "Yes" or "No" according to whether the statement is universally valid, i.e., valid in every structure satisfying the axioms. By the completeness theorem of first-order logic, a statement is universally valid if and only if it can be deduced from the axioms, so the Entscheidungsproblem can also be viewed as asking for an algorithm to decide whether a given statement is provable from the axioms using the rules of logic.
has abstract
En ciencias de la computación ...... de Turing resumido más arriba.
@es
En logique mathématique, on ap ...... arrêt d'une machine de Turing.
@fr
In de wiskunde en informatica ...... ls de Church-Turing-hypothese.
@nl
In mathematics and computer sc ...... n as the Church–Turing thesis.
@en
L'Entscheidungsproblem (in ita ...... lla teoria della computazione.
@it
O Entscheidungsproblem (termo ...... ento de Turing mostrado acima.
@pt
Проблема разрешения (нем. Ents ...... е: «теорема Чёрча — Тьюринга».
@ru
في الرياضيات تعد Entscheidungs ...... بينها وبين رسالة تشرتش تورنج).
@ar
可判定性
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
744,719,388
subject
hypernym
type
comment
En ciencias de la computación ...... itmética son ciertas o falsas.
@es
En logique mathématique, on ap ...... us les modèles (de l'égalité).
@fr
In de wiskunde en informatica ...... alde uitspraak bewijsbaar is v
@nl
In mathematics and computer sc ...... ioms using the rules of logic.
@en
L'Entscheidungsproblem (in ita ...... l'interno del sistema formale.
@it
O Entscheidungsproblem (termo ...... ento de Turing mostrado acima.
@pt
Проблема разрешения (нем. Ents ...... ований, но должен быть верным.
@ru
في الرياضيات تعد Entscheidungs ...... رتيب صحفا مستقلة تبين أنه من ا
@ar
可判定性
@zh
label
Entscheidungsproblem
@en
Entscheidungsproblem
@es
Entscheidungsproblem
@it
Entscheidungsproblem
@nl
Entscheidungsproblem
@pt
Problème de la décision
@fr
Проблема разрешения
@ru
مسألة القرار (رياضيات)
@ar
可判定性
@zh