Yes, but it's still true that for any two distinct finite strings S1 and S2, there will always be some description language in which S1 has lower Kolmogorov complexity than S2. So by appropriate choice of language I can render any finite string simpler than any other finite string.