Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00787653n
Noun Concept
Categories: Logic in computer science, Undecidable problems, Computability theory
EN
undecidable problem  Algorithmic insolubility  algorithmically insoluble  algorithmically unsolvable problem  Recursively undecidable
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
Definitions
Relations
Sources
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
decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer Wikidata
IS A
decision problem
Wikipedia
EN
undecidable problem
Wikidata
EN
undecidable problem
Wikipedia Redirections
EN
Algorithmic insolubility, algorithmically insoluble, algorithmically unsolvable problem, Recursively undecidable, semi-decidable, Uncomputable problem, undecidable language, undecidable set, unsolvable problem

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