In any case, stone knives and bearskins aside, I decided that the issue of science/tech gap would not be central in this arc.
P = NP is one of the million dollar questions chosen by the Clay Mathematics Institute. Go read about it on wikipedia for starters, if you’re interesting in learning more about it. It’s an interesting issue, and it revolves around the question of whether we can solve all problems we pose to a computer (this is a terrible, terrible simplification). As powerful as our computers are, there are problems that they can’t solve in polynomial time i.e. a finite amount of time. Most theoretical computer scientist don’t think that P = NP, given the assumption that the machine is a deterministic sequential machine.