A Language L may not be accepted by a Turing Machine if:
Posted: Thu Jul 14, 2022 9:26 am
a) It is recursively enumerable
b) It is recursive
c) L can be enumerated by some turing machine
d) None of the mentioned
b) It is recursive
c) L can be enumerated by some turing machine
d) None of the mentioned