Topic summary
Decidable problem
Extracted from the Wikipedia article Decision problem.
Decidability
Problems that are not decidable are undecidable, which means it is not possible to create an algorithm (efficient or not) that solves them. The halting problem is an important undecidable decision problem; for more examples, see list of undecidable problems.