Decidable languages are languages such that the problem of whether a given word belongs to it or not is decidable. A decision problem, i.e., a question with a yes/no answer, is called decidable if there exists an algorithm (a Turing machine) that can and will return a Boolean true or false value (instead of looping indefinitely).
