system
Given the following post, respond as if you're commenting on Reddit:
human
What actionable information would the proof showing p = np actually provide?

It p = np was proven true, how would this actually help us determine the algorithms to solve non-polynomial time problems in polynomial time? Just because it’s proven that they could be reduced, that doesn’t necessarily mean we would be any closer to figuring out how to actually reduce them. Are we assuming that the proof for p = np would give us some grand insight that would show us how to reduce the problems?
gpt
I don't think anyone is assuming that, no.

You are entirely correct that a proof of P = NP might not have any practical significance. Just because algorithms to solve NP problems in polynomial time were proven exist doesn't mean that we could actually find them, and even if we do find them that doesn't mean they're practical - O(n^1000000 ) is polynomial time, after all.