AWESOME AI PROOFS
← Problems
Research / Sep 2023

P versus NP: a disputed proof attempt

Can every problem whose solutions are efficiently checked also be efficiently solved?

Model / AI: GPT-4

disputed
Sep 2023

P vs. NP by prompting

Model / AI: GPT-4

disputed

a 97-turn GPT-4 dialogue concluding P != NP, resting on its own co-authors' "SAT requires exhaustive search" argument, which was refuted for restricting the class of algorithms without justification and then defended. P versus NP remains unresolved; the underlying argument is contested rather than settled.

Source review pending. Imported from the original notes; linked claims and artifacts have not been re-audited in this restructuring.