Good ideas and conversation. No ads, no tracking. Login or Take a Tour!
Since it's infinitely fast, even uncountably infinite spaces could be iterated through instantly, so I would have it test every one of the uncountably infinite number of possible proofs that P = NP (and every other unsolved problem) and check all of them for correctness, solving all currently open math problems. Then I'd do what forthewar said. That's all I can think of for now.