decidability
P91856
predicate
Indicates whether a given problem, property, or statement can be algorithmically determined to be true or false for all possible inputs.
Observed surface forms (4)
- isUndecidable ×2
- computabilityStatus ×1
- decidabilityOfTyping ×1
- decidabilityResult ×1
Sample triples (6)
| Subject | Object |
|---|---|
|
AIXI model
surface form:
AIXI
|
uncomputable via predicate surface "computabilityStatus" ⓘ |
| Diophantine equations | no algorithm exists to decide solvability over integers (Hilbert's tenth problem) via predicate surface "decidabilityResult" ⓘ |
| Hilbert’s tenth problem | undecidable ⓘ |
|
system F
surface form:
System F
|
typability problem via predicate surface "isUndecidable" ⓘ |
|
system F
surface form:
System F
|
type inhabitation problem via predicate surface "isUndecidable" ⓘ |
| System F | undecidable in general via predicate surface "decidabilityOfTyping" ⓘ |