3 ms·
Check my P=NP proof for errors
- porton 3y agoThe proof is based on inverting bijections, passing algorithms as arguments to algorithms, incompleteness of ZFC, reducing SAT to another NP problem.
- willprice89 3y agoI 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?