I don't think this is right. The Kolmgorov complexity as you wrote is the shortest description of some program in a universal language. If you have program P an

I don't think this is right. The Kolmgorov complexity as you wrote is the shortest description of some program in a universal language. If you have program P and you shorten it to an isomorphic program P', k(P) = k(P') as we have the true shortest program P* where k(P) = |P| <= k(P). P' has the same Kolmgorov complexity as P.