How is the algorithm that generates the digits of pi a compressed form of pi? It gives me all the information about the number in finite amount of time. In ran

How is the algorithm that generates the digits of pi a compressed form of pi? It gives me all the information about the number in finite amount of time. 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.