considering the non-sequential set of rolls 625631 you have the odds of exactly two 6's at 0.201 and also one 2 5 3 and 1 each at 0.402
0.402^4 * 0.201 = 0.00524928641, or ~244 x more likely.
1) equal 1s and 0s
2) all 1s
3) all 0s
See which one is more likely.
If you know it has been generated by a valid random number generator, then no.
But if you know there is a chance it came from something other than a valid random number generator, then you would have to classify sequences like 11111111 in a "highly suspicious" category.
But what if we say, we're going to generate that binary sequence by 8 successive flips of a coin, and we are aiming for 11111111 specifically? Then we have to multiply eight times. (0.5)^8 == .00390625 == 1/256
Where it gets a bit tricky is if we ask people to place bets after each successive flip of the coin. For example, starting with no flips, ask players to bet on the likelihood of 8 heads in a row. Next round, bet on the likelihood of 7 heads in a row, knowing the first was a head, etc. What minimal odds should the house give after each flip in order to reliably turn a profit on this game? Does it matter how many players are at the table when it comes to calculating those odds?
Think of it in terms of coin tosses. Two heads is less likely than a head and a tail, because there are two sequences, 10, and 01, that map to the class of having one tail and one head. But there is only a single sequence of 00 in the class of all heads.
Comparing mean and std dev can be used to estimate the distance between two distributions. See also, statistical testing.
I think we learn that older people are less willing to put up with silly instructions.
Edit: saw this other comment ( https://news.ycombinator.com/item?id=31224738 ) about how kolmogorov complexity is a bad metric and am now second guessing myself
One approach would be estimate the probability distribution from the input sequence and calculate the KL-divergence [1] of that to the uniform distribution. This gives one objective measure of randomness. There are many others!
TL;DR: There are definitions of randomness that can be tested against.
[1] https://en.m.wikipedia.org/wiki/Kullback–Leibler_divergence
Let’s imagine applying your measure to a whole bunch of sequences, each of length N, with the elements of each actually drawn from a uniform distribution. You measure the randomness of each one. You’ll get a range of DLK results, distributed from, in your interpretation, “very random” to “not that random”. All-H or mostly-H will come up sometimes, the distribution estimator will return a skewed result, and it will get a divergent “score”. But everything came from the same distribution. So we’re now measuring the output of an actually random process and saying “we’ll, it’s usually random but not quite always”
In contrast, let’s try your method on a different population of sequences, where instead of pulling the sequence elements from a distribution, every sequence is a hardcoded copy of HTHTHT… That gives “perfectly random”, even though it was very far from a random process.
That’s close to what the study authors are doing here, except with a different definition of “random looking”. It’s measuring a property of a sequence, but it isn’t whether it was randomly generated.
We could debate about whether this is a good measure of “random looking” and there could be lots of alternatives with no objectively best. But that is my point: if I ask “make me something random-looking”, I am only asking “how closely does your measure of post-facto randomness match mine?” An actual random sequence would be, well, random.
1. Whether people of different age groups agree that random sequences are more complex as defined by the study’s notion of complexity.
2. Whether people of groups have the physical ability to generate those sequences in a web browser.
3. Whether people of groups have the mental ability to generate those sequences.
Of these, the study purports to measure 3, but it’s actually conflating all of these.
To other people. They specified this in the study instructions. (Not defending the study, I think it's flawed too.)
Though perhaps there is a body of existing literature showing that their complexity estimator matches people’s assessment of “randomness”? If so, does it include people over 60?
That's correct.
> They’d have to measure that by showing a bunch of people each sequence and asking “is this random?”
Agreed!
> Instead, they threw a complexity formula at it, which measures some specific thing, but not “other people”
Yep, they botched the study.
Nonetheless, the "ask" that you criticized was fine. It explained that the subject should craft a pattern which would appear random to other people, and imo there's nothing wrong with that ask. The mistakes came afterwards.
I think 1 1 2 3 4 looks more real than 1 2 3 4 5
In that a draw of 5 numbers is likely to include at least one number twice and one number zero times.
But is that the goal? Is it communicable to the audience
Probably why I got an "age" of 60.
Ironically based on eyeballing the chart it actually did predict my age within 5 years
“Make a sequence that looks random” is sort of a nonsensical ask. Looks random to whom? To our algorithm, is what they meant. There’s no such thing as a randomness test that can look at a sequence and decide “is it random?”, so this algo measures something else and uses it as a proxy for “looking” random to…the study authors, I guess? There’s no ground truth here; it’s chasing a ghost.
I don’t know what information we could even hypothetically gain from knowing older people score lower according to this algo—-perhaps that the paper’s authors are younger than 60 and thus picked a different “randomness-looking” algo than they would if they were older? At best that older people have an equally incorrect but qualitatively different idea of “random looking”?
Of course we did not learn that; we only learned that older people pick all-H or all-T more. But my point is that there wasn’t really anything interesting at stake anyway.
(Edit: expanding a bit)