For both Shannon entropy and Kolmogorov complexity, deterministic transformations cannot meaningfully increase the information content of an object.
Epiplexity, a formalization of information capturing what computationally bounded observers can learn from data.
Epiplexity captures the structural content in data while excluding time-bounded entropy, the random unpredictable content exemplified by pseudorandom number generators and chaotic dynamical systems.