What is meant by decidable language in Theory of Automata and Formal Languages?

Correct Answer: A

a language for which some Turing machine halts on every input and decides membership

The correct answer is a language for which some Turing machine halts on every input and decides membership.