For any given state of matter and energy, there is a maximal number of possible states. Then, for any given computer existing in our universe there is a finite amount of accessible states, given that the expansion of the universe creates a horizon beyond which creates a limit to the volume we can read back data from.
Couple this with the fact that you can not create an algorithm that can arbitrarily compress any given input string, and then for any given computer you can find input strings that requires more state to represent than said computer can contain. Even if you allow for output over time, for any given such computer you can find an input string that is sufficiently incompressible that finding the shortest possible representation requires more intermediate state than the computer can contain, and that can be true even if a sufficiently large computer will make it possible to find patterns that makes the data very compressible.
In fact, that is what the article is pointing out: The universe may be a lot more regular than it appears, but it is possible that we may never be able to determine what the patterns are because it may be impossible to hold or compute over enough state to be able to determine what the patterns are in a way that lets us identify the patterns.
It is also possible that it turns out to be possible to easily create such a minimal program, but the article also points out that the vast majority of possible universes are incompressible.
For us to be able to compute the most compact description of our universe we 1) need to be in a compressible universe (or the description will subsume the totality of the universe itself), 2) need to be in one where the shortest possible description can be computed with the intermediate states possible to contain within the observable universe.
As the article points out, without additional knowledge of what type of universe we are in, the odds are firmly against us in that respect.
Couple this with the fact that you can not create an algorithm that can arbitrarily compress any given input string, and then for any given computer you can find input strings that requires more state to represent than said computer can contain. Even if you allow for output over time, for any given such computer you can find an input string that is sufficiently incompressible that finding the shortest possible representation requires more intermediate state than the computer can contain, and that can be true even if a sufficiently large computer will make it possible to find patterns that makes the data very compressible.
In fact, that is what the article is pointing out: The universe may be a lot more regular than it appears, but it is possible that we may never be able to determine what the patterns are because it may be impossible to hold or compute over enough state to be able to determine what the patterns are in a way that lets us identify the patterns.
It is also possible that it turns out to be possible to easily create such a minimal program, but the article also points out that the vast majority of possible universes are incompressible.
For us to be able to compute the most compact description of our universe we 1) need to be in a compressible universe (or the description will subsume the totality of the universe itself), 2) need to be in one where the shortest possible description can be computed with the intermediate states possible to contain within the observable universe.
As the article points out, without additional knowledge of what type of universe we are in, the odds are firmly against us in that respect.