Why wouldn't you be able to do that without a proof? I don't see the value of th... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

Jensson 29 days ago | parent | context | favorite | on: Mathematics in the age of AI

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.

a2ff6eeb0 29 days ago | [–]

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.

Scarblac 28 days ago | [–]

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?

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact