You know, it'd be a lot more helpful if it was anything remotely close to "done" rather than vaguely handwaved with some sort of fuzzy (mis)understanding of terms being discussed at it's core. What does "difference in Kolmogorov complexity" even mean when your program of length L does not have any equivalents of length <L ? If it has no simpler equivalent, Kolmogorov's complexity is L.

Given a program describing some "simple rules" (what ever that means, anyway), one can make a likewise large number of variations where, instead of a single photon being created somewhere obscure or under some hard to reach conditions, photons are created on a randomly spaced regular lattice over some space of conditions, for example, with some specific spacing of the points of that lattice. Which is very noticeable, and does not locally look like any "simple rules" to much anyone.

edit: note that most definitions of T.M. do not have pointers, and heads move by 1 step at a time, which actually makes it very nontrivial to do some highly localized, surgical changes to data, especially in the context of some program that's applying same rules everywhere. So it is not obviously the case that a single point change to the world would be less code than something blatantly obvious to the inhabitants.