logoalt Hacker News

Jenssontoday at 4:10 AM2 repliesview on HN

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.


Replies

a2ff6eeb0today at 4:46 AM

From my understanding, the two are equivalent; if you can reduce an NP problem to a P problem, you've proven P=NP. The rest is application.

show 1 reply
Scarblactoday at 10:55 AM

Why would it not be able to find reductions now, but be able to find them just by being told that P=NP is definitely true?