Is there an unstated connection to computational complexity here? The article focuses on the number of possibilities and basically argues that N is impractically large, but I think that means there's an implicit claim behind that that we don't have an efficient search algorithm so the large N is fatal rather than a hardware problem. Does that make sense to anyone else?