e/Undecidable problem

Information
has gloss	eng: In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct a single algorithm that always leads to a correct yes-or-no answer – the problem is not decidable.
lexicalization	eng: undecidable problem
instance of	c/Formal theories of arithmetic

Meaning
Portuguese
lexicalization	por: Problema indecidível