Independence of P vs. NP in regards to oracle relativizations
Jerrald Meek

TL;DR
This paper argues that the methods used to approach the P vs. NP problem are unaffected by oracle relativizations, suggesting that the question's resolution is independent of such relativizations.
Contribution
It demonstrates that the techniques in previous articles are not influenced by oracle relativizations, indicating the P vs. NP problem's independence from these relativizations.
Findings
Methods are unaffected by oracle relativizations
P vs. NP independence from oracle relativizations
Supports the intrinsic difficulty of resolving P vs. NP
Abstract
This is the third article in a series of four articles dealing with the P vs. NP question. The purpose of this work is to demonstrate that the methods used in the first two articles of this series are not affected by oracle relativizations. Furthermore, the solution to the P vs. NP problem is actually independent of oracle relativizations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Mathematics and Applications · Algorithms and Data Compression
