A fascinating look at how to group different kinds of answers we can get from computing. Brailsford mused about how this particular example took an order of magnitude longer on the previous generation of computers compared to recently.
He also mentions exponential (n^2) and super-exponential problems (n^2 n times (?) I don't even know how to express that).
