Summer of Math Exposition

I can curl my fingers in 3 positions with will give me 3^10 positions. Some demonstration of what the code does would be helpful

This video lacks visuals to help understand the few concepts. Even simple graphs of runs of the algorithm would help a lot to see what is happening. As an introduction it felt more like something that might scare a new audience rather than easing its discovery of the concepts, since the talk seems to be given for people that already know the topic rather than those being introduced to it.

Very interesting topic, but only possible to (almost) follow because I’ve already read about the topic and have implemented CRDTs and hyperloglog

Short and sweet. This gets at the intuition without getting bogged down in detail.

I liked this video, because it’s quick and to the point. It’s well-explained.

I wish that it had an example, and that it had a specific statement about what exactly the Morris Counter achieves. In particular, what exactly are the probabilistic error bounds?