A Class of Examples Demonstrating That 'P ≠ NP' in the 'P Vs NP' Problem

Download Edit this record How to cite View on PhilPapers
Abstract
The CMI Millennium “P vs NP Problem” can be resolved e.g. if one shows at least one counterexample to the "P = NP" conjecture. A certain class of problems being such counterexamples will be formulated. This implies the rejection of the hypothesis that "P = NP" for any conditions satisfying the formulation of the problem. Thus, the solution "P is different from NP" of the problem in general is proved. The class of counterexamples can be interpreted as any quantum superposition of any finite set of quantum states. The Kochen-Specker theorem is involved. Any fundamentally random choice among a finite set of alternatives belong to "NP" but not to "P". The conjecture that the set complement of "P" to "NP" can be described by that kind of choice exhaustively is formulated.
PhilPapers/Archive ID
PENACO-6
Upload history
Archival date: 2020-08-07
View other versions
Added to PP index
2020-08-07

Total views
37 ( #51,040 of 55,806 )

Recent downloads (6 months)
37 ( #21,125 of 55,806 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.