provedUndecidableUsing
P53737
predicate
Indicates that the undecidability of one problem, theory, or statement was established by applying or reducing it to another specific method, result, or formal system.
Sample triples (3)
| Subject | Object |
|---|---|
| Entscheidungsproblem |
Turing machine
ⓘ
surface form:
Turing machines
|
| Entscheidungsproblem | lambda calculus ⓘ |
| Entscheidungsproblem | reduction from the halting problem ⓘ |