The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:

• A. Decidable
• B. Undecidable
• C. Computable
• D. None of the mentioned