The same mathematical problem or operation can have several different Kolmogorov complexities, depending on how efficient an algorithm is when solving the probl

The same mathematical problem or operation can have several different Kolmogorov complexities, depending on how efficient an algorithm is when solving the problem. I don't think there's any way around it. If I create a Turing Machine that calculates 1+1 by counting all the atoms in the universe, it's going to have a high complexity.