Common
Undecidable problem
Yes-or-no question that cannot ever be solved by a computer
Undecidable problem
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.
Open boosters, collect cards and trade them. Free to play.
Play for free