decidability

P91856
predicate

Indicates whether a given problem, property, or statement can be algorithmically determined to be true or false for all possible inputs.

Try in SPARQL

All labels observed (5)

Label Occurrences
isUndecidable 2
computabilityStatus 1
decidability canonical 1

Description generation (PDg)

The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.

Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning.  
# Instructions
Focus on describing the relationship, not the entities themselves. 
# Response Format
Begin the description with \' Indicates...\'
Input
Predicate: decidability
Generated description
Indicates whether a given problem, property, or statement can be algorithmically determined to be true or false for all possible inputs.

Sample triples (6)

Subject Object
Hilbert’s tenth problem undecidable ⓘ
system F
surface form: System F
type inhabitation problem via predicate surface "isUndecidable" ⓘ
system F
surface form: System F
typability problem via predicate surface "isUndecidable" ⓘ
Diophantine equations no algorithm exists to decide solvability over integers (Hilbert's tenth problem) via predicate surface "decidabilityResult" ⓘ
AIXI model
surface form: AIXI
uncomputable via predicate surface "computabilityStatus" ⓘ
System F undecidable in general via predicate surface "decidabilityOfTyping" ⓘ