bn:00787653n
Noun Concept
EL
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
Relations
Sources