Undecidable problem

Yes-or-no question that cannot ever be solved by a computer

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. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.

This keyword could refer to multiple things. Here are some suggestions: