決定可能性
1. Decidability (logic)In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas, or, more precisely, an algorithm that can and will return a Boolean true or false value (instead of looping indefinitely). Logical systems such as propositional logic are decidable if membership in their set of logically valid formulas (or theorems) can be effectively determined.
Read “Decidability (logic)” on English Wikipedia
Read “決定可能性” on Japanese Wikipedia
Read “Decidability (logic)” on DBpedia
Read “Decidability (logic)” on English Wikipedia
Read “決定可能性” on Japanese Wikipedia
Read “Decidability (logic)” on DBpedia
Discussions
Log in to talk about this word.