[thaumasiotes]

There was a thread on HN semi-recently where I observed that if you think about classifying complexities ("big-O of n squared") by polynomial degree (so we think of O(n^2) as "2"), the logarithm function gives you a literally infinitesimal value.

I was then asked about sources for what amounts to an easy homework problem.