logoalt Hacker News

a2ff6eeb0today at 4:06 AM2 repliesview on HN

sure, agreed, but once you have a proof, you can probably get AI to reduce other problems to that problem in P.


Replies

Scarblactoday at 10:54 AM

Well then, just tell the AI that the statement is true and it will find reductions!

In reality, it wouldn't depend on the truth value of the statement, but on the AI understanding the proof. If it understands it then it might be able to use it to find reductions.

So the point remains, knowing that P=NP isn't what's important, it's the proof that matters.

show 1 reply
Jenssontoday at 4:10 AM

Why wouldn't you be able to do that without a proof? I don't see the value of the proof here, just ask the AI to solve the problem you want and the proof isn't needed.

show 2 replies