I've been impressed that even when one of my hands is shifted by one on the keyboard, it can still figure it out.

Though also, even if memory access is O(1), it's still O(whatever your hash function takes), which I think in practice will be O(log n) for n distinct items since that's what the key length needs to be. (And if you ignore more bits than that of the key, you increase the collision rate.)

If you account for general relativity, I think it's even sqrt(n)--if you try to store information too densely, it'll collapse into a black hole.

Designed by none other than Leon Theremin. *That* Leon Theremin.

Furrier analysis!

I got a text from them too recently! And they were so nice, they even signed it "have a delightful day filled with success and positivity," a very idiomatic phrase often used by American government agencies!

I've been playing that (on PC) and enjoying it!

In 1991 I think. en.wikipedia.org/wiki/SimAnt

Now I'm thinking about this song in a whole different light. www.youtube.com/watch?v=E8fk...