Earlier quoted context omitted.
yeah that seems fine. there's like no good reason to do that. are you trying to simulate reality or something? but my point still stands, choose whichever calculation you think is important to be able to do with Ω, defined as f(Ω), square it for good measure, and set that as the max, the min, and the number of numbers in between each integer. The total number of possible numbers will be ~2*f(Ω)⁴ which should be more…
AES256 already has more possible keys than exist atoms in the visible universe and that’s a pretty mundane thing. If you wanted to store all those keys, that’s even large. # of atoms in the universe turns into a very small very quickly when talking about permutations and permutations come up all the time (mathematical simulations, probability computations, etc). I really don’t understand what point you’re trying to m…
Where I get stuck with this is how might we measure that? Continuous measurements and infinite measurements are not something we can make. We fit continuous theories to discrete measurements--and the good ones fit really well!--but until we can measure it how can we actually know? I concluded we just can't, and we have to be OK with that.