Undecidable - definition, pronunciation
Amer.
Brit.
|ʌndɪˈsaɪdəb(ə)l|
adjective
- (mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included.
- (mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)
- (mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)
Current translation version is made automatically.
You can suggest your own version.
Changes will take effect after the administrator approves them.
Original text in English:
Our translation to English:
Community translations to English:
This feature is allowed to authorized users only.
Please, register on our website at registration page. After registration you can log in and use that feature.
Please, register on our website at registration page. After registration you can log in and use that feature.
