Check my P=NP proof for errors (based on incompleteness of ZFC)

  • Thread starter Thread starter porton
  • Start date Start date
  • Tags Tags
    Proof
AI Thread Summary
The discussion centers on a request for feedback on a proof of the P=NP problem, which is based on set theory and logic, particularly the incompleteness of ZFC. The proof incorporates concepts like inversions of bijections, algorithms as arguments of other algorithms, and the reduction of SAT to another NP problem. However, the moderator notes that the forum does not engage in reviewing unpublished work and emphasizes the improbability of a new proof succeeding where many established scientists have failed. The thread concludes with a suggestion that if someone were to solve the P=NP problem, they should consider monetizing their findings rather than publishing them.
porton
Messages
5
Reaction score
0
TL;DR Summary
Check my P=NP proof for errors.
Please check for errors my proof of P=NP:
PDF file
It is based on set theory and logic (incompleteness of ZFC). It uses also inversions of bijections, algorithms as arguments of other algorithms, reduction of SAT to another NP problem.

[Moderator's note: link removed.]
 
Last edited by a moderator:
Technology news on Phys.org
porton said:
TL;DR Summary: Check my P=NP proof for errors.

Please check for errors my proof of P=NP:
PDF file
It is based on set theory and logic (incompleteness of ZFC). It uses also inversions of bijections, algorithms as arguments of other algorithms, reduction of SAT to another NP problem.
Sorry, I'm afraid we do not debunk or proofread unpublished work here. A discussion requires publication in a serious science journal.

However, this problem is so old that it is extremely unlikely that you have achieved where hundreds of scientists have failed.

This thread is closed. For interested readers about the problem, see
https://www.physicsforums.com/insights/p-vs-np-conjecture-calculations-and-meaning/
 
  • Like
Likes berkeman
A bit of advice for the lucky one who actually will solve this problem. If it would be ##P=NP## which I seriously doubt, then do not publish it! Deduce a polynomial traveling salesman algorithm instead, secure your copyright, and sell it to the thousands of traffic companies in the world that run trucks, container ships, or airplanes.
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I have a quick questions. I am going through a book on C programming on my own. Afterwards, I plan to go through something call data structures and algorithms on my own also in C. I also need to learn C++, Matlab and for personal interest Haskell. For the two topic of data structures and algorithms, I understand there are standard ones across all programming languages. After learning it through C, what would be the biggest issue when trying to implement the same data...
Back
Top