Definition
Decidable Decision Problem
Let
be a decision problem and its language over a finite alphabet . Then,
is called decidable if there is a Turing Machine that halts on every (set of all strings) and accepts exactly those .
Semi-Decidability
Given that semi-decidability is a weaker form of decidability, every decidable decision problem is semi-decidable.