Size of the language accepted by a Turing Machine I want to figure out if the following language is Turing decidable, Turing acceptable but not turing decidable, or neither. The language is     

{ρ(M) : |L(M)| ≤ 10}  


My question for this problem is what does |L(M)| ≤ 10 mean? At first, I thought it meant that the language will only accept strings that are less than or equal to 10 in length, but I am not sure
... what does $|L(M)| \leq 10$ mean?


This means that the size of the language accepted by the TM $M$ is less than or equal to $10$. In other words, TM $M$ accepts no more than $10$ strings (inputs), while the length of any accepted input may be greater than $10$.