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.
Posted: Thu Jul 14, 2022 9:26 am
a) Turing acceptable
b) decidable
c) undecidable
d) none of the mentioned
b) decidable
c) undecidable
d) none of the mentioned