A language L is recursively enumerable if L=L(M) for some turing machine M. Which among the following cannot be among A
Posted: Thu Jul 14, 2022 9:26 am
a) yes w ∈ L
b) no w ∉ L
c) M does not halt w ∉ L
d) None of the mentioned
b) no w ∉ L
c) M does not halt w ∉ L
d) None of the mentioned