From your link: "The overall Kolmogorov complexity of a string is thus defined as K(x)=|p| where p is the shortest program string for language L such that L(p)

From your link: "The overall Kolmogorov complexity of a string is thus defined as K(x)=|p| where p is the shortest program string for language L such that L(p)=x and we consider all programming languages." This is false. No one considers "all programming language", we consider one fixed language (by fixed you can/should mean: independently of the input, or in a different way: you define the language for all possible inputs). (But it can be ANY universal language chosen from all languages (due to the provably constant overhead) - that's true, but according what follows in your link, your definition not meant it this way.)