You can't come up with a counterexample for P != NP because there isn't a formula to disprove. For P = NP you would propose a general algorithm to convert all NP problems into P in P time, and an AI could then find a counterexample which would disprove that particular method. To demonstrate P != NP you need to prove that no possible algorithm can convert any NP into P which is much harder than providing a counterexample.
AI has just gotten to the intelligence that it can make clever counterexamples to mathematical conjectures, but the frontier isn't quite smart enough that it can make novel contributions to mathematics. We are really close though. Only a matter of months away.
AI has just gotten to the intelligence that it can make clever counterexamples to mathematical conjectures, but the frontier isn't quite smart enough that it can make novel contributions to mathematics. We are really close though. Only a matter of months away.