Comments by "Lawrence D’Oliveiro" (@lawrencedoliveiro9104) on "Spanning Tree" channel.

  1. That’s the basis of Kolmogorov complexity. But if you don’t know the process, how do you figure it out? Consider that encrypted data, by design, looks indistinguishable from random noise. But if the plaintext data has low information content, then it would indeed be highly compressible, you just wouldn’t know it from the encrypted version.
    5
  2. 6:55 That efficiency comes at a cost, namely less robustness. Assuming the same characteristics storage/transmission medium, a block of 247 bits is 247/7 times more likely to have errors in it than a block of 7 bits. But you only have 8/3 times the parity bits to protect it.
    2
  3. Proving randomness means proving the absence of information about what comes next. Which seems in general impossible to do. (Not the same thing as “you can’t prove a negative”, which is a nonsensical statement, by the way.)
    2
  4. Human beings are notorious for picking “random” numbers that have patterns in them. There is a Numberphile video where a mathematician makes a bet that the guy making the video cannot pick truly random numbers, and cleans him out.
    1
  5. Quantum theory says that reality is indeed founded on true randomness.
    1
  6.  @BradenBest  Bell’s inequality quantifies the random probabilities involved.
    1
  7.  @BradenBest  I’ll just let that speak for itself.
    1