>>Similar logic to the Invariance Theorem for Kolmogorov complexity[0], which essentially states that the programming language you use to calculate the complexity (description length) of an object doesn't matter much, because Turing-complete languages can all simulate each other.

"Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy." Alan Perlis [1]

[1]https://en.wikipedia.org/wiki/Turing_tarpit