Remix.run Logo
▲ hyperbovine 8 hours ago

The recipe seems to be, pick a problem whose solution is highly verifiable, then throw the equivalent of ten billion hours of expert-level thought at it. If you can narrow the search space a lot, all the better. P != NP is sure to follow soon enough.

▲jonahx 4 hours ago | parent | next [-]

> 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.

▲hyperbovine 4 hours ago | parent [-]

I defer to Scott. But, I mean, look at the trajectory in the past six months...

▲jonahx 3 hours ago | parent [-]

Right. Just saying the fall of these "step function" type problems aren't a forgone conclusion yet. It could easily be the case that some problems (who knows which?) are in an entirely different dimension of complexity, and would be out of reach of even much, much more powerful AI.

▲conradkay 8 hours ago | parent | prev [-]

Their last two examples are extremely verifiable.