Im not familiar with complexity theory, so please pardon any errors.
'A completely random string is one which no algorithm can process and so a completely random string is maximally compressed.'
Why does a completely random string have to be maximally compressed, does there not exist other algorithmically unprocessable strings? For example some infinity string (or finite but algorithmically/computationally infeasable) ?
The idea here then that if one was to formulate all yes/no questions of the universe into this random bit within the kolomogrov framework above, that some information would be lost whilst processing the set of all questions. Hence leading to a lack of answers on output.
This assumes that all relevant yes/no questions can be presented within this framework, a rather significant assumption. Have you the mathematical proof ?
I think it depends on the observer as to whether one percieves randomness in the universe or not. I do not think the universie can be considered as absolutely random/ordered (disregarding the degree of randomness/chaoticity), it's entirely dependent on ones perspective/point of view, similar to fractal/hausdorff dimension and quantum theory.
Hence there may exist inherent randomness from some perspectives, but not from others.