Question

Problems which have no algorithm, regardless of whether or not, they are accepted by a tm that fails to halt on some input, are referred to asselect one:a. Undecidableb. Computablec. Noned. Decidable

Answer 1

"problem which have no algorithm regardless of whether or not they are accepted by a a time that fails to halt it on some input are referred to a selected one "

hope it helps you ...❤