Kolmogrov complexity proves that while language A can emulate capability X from language B, it is impossible to do so without writing B in A. In which case, it is still B doing X.

So, in a literal sense, it can be impossible to do X in A and possible to do X in B, even though A and B are Turing complete.