There's a gulf of difference between being unable to prove that -any- string has complexity greater than some constant and actually being able to actually specify -arbitrary- strings using less than that constant in computational resources.

Chaitin's Incompleteness Theorem doesn't limit complexity, only -provable- complexity.