> P != NP is sure to follow soon enough
Not an expert, but from comments I've heard by experts P != NP is much further out of reach than Riemann. Eg, Scott Aaronson:
> First, almost no one in theoretical computer science—not counting the cranks, whose missives fill my inbox every week!—spends their time directly trying to prove P≠NP. Why not? For the same reason why you wouldn’t embark on a manned mission to another galaxy, if you hadn’t even set foot on Mars yet.
I defer to Scott. But, I mean, look at the trajectory in the past six months...