Hacker News new | past | comments | ask | show | jobs | submit login

Hm I'm curious about the complexity measurement for the coin tosses. How does it work?

There is suspicious clustering in the plot, at complexity slightly lower and higher than -1. Complexity -1 is also more sparse than seems reasonable from the shape/density of the cloud.




I'm also curious about this. Randomness doesn't actually look very random. There's a surprising number of repeated characters.


I think, that's a common misconception about randomness: It doesn't mean the number has to change with every roll of dice. On the contrary the longer the sequence large clusters of the same number will occur.

It's maybe not so counter-intuitive as the Birthday paradox, but maybe already showing how bad our intuition is at grasping randomness. Initially I had hoped about research on that, which is probably very hard. - Or not? Couldn't you look at the n-gram distributions of the data and look how much that is "random", i.e. are people avoiding clusters harder than they should?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: