Well, see, I would disagree with your presumption. The data might look random to you, but I could just point out that all the digits are actually taken from PI, starting with 3^^3rd digit. That simplifies the complexity tremendously. Or I could say I got those digits randomly. That again simplifies the complexity, because generating that number was simple.
If my presumption that the digits are not very compressible is wrong, then you have not really responded to Daniel’s point about the ridiculous roundness of the number (where roundness is one way a number can be compressible).
Or I could say I got those digits randomly. That again simplifies the complexity, because generating that number was simple.
No. Getting “random” digits is not simple, or even an available action, for a deterministic generator. Saying to get “random” data can feel simple because you are just pointing at some source of data that you are ignorant about, but really, you have to account for the complexity of that source of data.
Well, see, I would disagree with your presumption. The data might look random to you, but I could just point out that all the digits are actually taken from PI, starting with 3^^3rd digit. That simplifies the complexity tremendously. Or I could say I got those digits randomly. That again simplifies the complexity, because generating that number was simple.
If my presumption that the digits are not very compressible is wrong, then you have not really responded to Daniel’s point about the ridiculous roundness of the number (where roundness is one way a number can be compressible).
No. Getting “random” digits is not simple, or even an available action, for a deterministic generator. Saying to get “random” data can feel simple because you are just pointing at some source of data that you are ignorant about, but really, you have to account for the complexity of that source of data.