This is basically the approach taken by information theory: one of Shannon's many insights is that the content of a message doesn't matter for communicating it; only how well the receiver can predict it. If there are two possible messages, it doesn't matter if they're "yes"/"no" or "invade Portugal"/"bring me a sandwich", the information being communicated is the same (1 bit).
In this way, something is "random" if it's maximally unpredictable, i.e. if it can't be compressed. If we pick a Universal Turing Machine as the receiver, we get the characterisation of randomness given by Kolmogorov complexity.