Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00787653n
Noun Concept
JA
決定不可能問題  決定不能問題
EN
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. Wikipedia
Relations
Sources
IS A
決定問題
Wikidata
JA
決定不可能問題
Wikidata Alias
JA
決定不能問題

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License