rice theorem problem

Question

L(M)

has at most 10 strings

We can have Tyes

for ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive).

 

problem :

It should not b  Tyes Σ∗  and Tno for ϕ