Decidability: Difference between revisions
Appearance
Content deleted Content added
No edit summary |
m indecidability→undecidability - Correct typos in one click |
||
(27 intermediate revisions by 24 users not shown) | |||
Line 1: | Line 1: | ||
{{Wiktionary}} |
|||
The word '''''decidable''''' has a variety of meanings in [[mathematical logic]], [[computing]], and [[recursion theory]]. |
|||
The word '''''decidable''''' may refer to: |
|||
* [[Decidable language]] |
|||
⚫ | |||
*[[Decidability (logic)]] for the equivalent in mathematical logic |
|||
*See [[recursive set|decidable set]] for a meaning in [[recursion theory]] (i.e., the theory of computability). |
|||
*[[Decidable problem]] and [[Undecidable problem]] |
|||
*See [[decidable language]] for a related meaning in computing. |
|||
⚫ | |||
* [[Recursive set]], a "decidable set" in recursion theory |
|||
==See also== |
|||
{{disambig}} |
|||
* [[Decision problem]] |
|||
* [[List of undecidable problems]] |
|||
* [[Decision (disambiguation)]] |
|||
* [[Decide (disambiguation)]] |
|||
{{disambiguation}} |
Latest revision as of 15:04, 6 November 2022
Look up decidability in Wiktionary, the free dictionary.
The word decidable may refer to:
- Decidable language
- Decidability (logic) for the equivalent in mathematical logic
- Decidable problem and Undecidable problem
- Gödel's incompleteness theorem, a theorem on the undecidability of languages consisting of "true statements" in mathematical logic.
- Recursive set, a "decidable set" in recursion theory