Turing Machine

Question

$L(M)$ = Contains atmost $10$ Strings ?               Is it Recursively enumerable ?

According to me its Not. Because according to Rices theorem there exist a non monotonic property which makes it Non recognizable. because   $T_{yes}$ = $\phi$(i.e. NULL)      and     $T_{no} = (a+b)^* $   say $\Sigma = \{a,b\} $   and     $T_{yes}$ is proper subset of $T_{no}$

Hence its not Recursively enumerable   right?

Comments

Absolutely correct.
It's not even RE. :)

---

Thnku :)