For Rice's Theorem to prove the language is undecidable for the following :
(1) L(M) has at least 10 strings
We can have Tyes for Σ∗ and Tno for ϕ. Hence, L={M∣L(M) has at least 10 strings} is not Turing decidable (not recursive). (Any other Tyes and Tno would also do. Tyes can be any TM which accepts at least 10 strings and Tno any TM which doesn’t accept at least 10 strings )
My question is how to design this TM which will accept simga* as well as keep count that the no. of strings are >=10 ( In other words how to prove the above using Rice's theorem)
