Decidability
A decision problem A is called decidable or effectively solvable if A is a recursive set. A problem is called partially decidable, semidecidable, solvable, or provable if A is a recursively enumerable set. Problems that are not decidable are called undecidable.
The halting problem is an important undecidable decision problem; for more examples, see list of undecidable problems.
Read more about this topic: Decision Problem