Check my P=NP proof for errors
drive.google.com
Check my P=NP proof for errors
1–3 of 3 posts
Re: Check my P=NP proof for errors
#2The proof is based on inverting bijections, passing algorithms as arguments to algorithms, incompleteness of ZFC, reducing SAT to another NP problem.
Re: Check my P=NP proof for errors
#3The proof is based on inverting bijections, passing algorithms as arguments to algorithms, incompleteness of ZFC, reducing SAT to another NP problem.
I don't remember enough CS theory to make heads or tails of this, but I'm just curious why post it here for review rather than taking it to a CS department somewhere or sending it to a journal for review?