A language L is said to be ____________ if there is a turing machine M such that L(M)=L and M halts at every point.

• A. Turing acceptable
• B. decidable
• C. undecidable
• D. none of the mentioned