Give an example of a language l such that |l|=5 and |l^2|=16.

He can define pas follows: Let P be defined on the set of languages accepted by some Turing machine M. Let it be True if 10 ] is 5 and False otherwise.  

Explanation:

The domain of P is the SD languages since it is those languages that are accepted by some Turing machine H. P is nontrivial since P({ a, aa, aaa, , , , b, bb, bbb, , , } ) is True and P ( 5 ) is False.  

Thus {< M> is a Turing machine and I L I - 5 and  I L I - 16 }

what? ? i don't get it