If you add a rule such as not using Algorithm X, it's trivial to create an Algorithm Y that generates the same output and it's barely any longer than X. For example, by adding any meaningless instruction at the start of algorithm X.
Of course, discovering what the shortest expression for a given sequence is is not a computable problem. So we can't always know if we've found the best form of compression for a sequence, we can only find an upper bound.
Or does 'simple' mean like an extractor for a standard archive file? Did you know that RAR is turing complete?
Maybe 'simple' has to be defined by limiting how much execution time you have per output byte?
You're confusing theoretical compressibility with the actual compression ratios you get when you put a string through typical compression functions.
Here's a different example. Suppose you have ASCII text encrypted with AES with the AES decryption key appended to it. Run that through gzip and you'll probably get output which is larger than the input. But here's a different compression algorithm that will work much better: Decrypt the encrypted data with the key and then compress the plaintext with gzip.
It isn't that the original string is of the sort that can't be compressed, it's that you need a compression function which is suited to the input. Pi is like that.
Compare this to other strings, like the output of an environmental hardware random number generator, which will almost always be totally incompressible whatsoever.
In randomness theory, the definition of the most compressed form of a sequence S is, given a computer C, the shortest program with output S in C.
So the program that generates the output of the simulation of the pendulums is a compression of it's output. Since it's and infinite sequence that can be compressed into a finite program, it is not random from the perspective of information theory or randomness theory.
I guess in other words, the more interesting question is this: can we generate hard to compress pseudorandom sequences with simple algorithms - if the algorithm description by itself can not be used as "compression"?