The Philosophical Ontological Proof for P=NP

Abstract

A proof for P=NP in modal logic. What it takes to simulate all particles in the universe correctly.

Categories

Add categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

A model-theoretic proof for P ≠ NP over all infinite Abelian groups.Mihai Prunescu - 2002 - Journal of Symbolic Logic 67 (1):235 - 238.
Consequences of the Provability of NP ⊆ P/poly.Stephen Cook & Jan Krajíček - 2007 - Journal of Symbolic Logic 72 (4):1353 - 1371.
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.
An Argument for P = NP.Selmer Bringsjord - 2017 - Minds and Machines 27 (4):663-672.
P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
Clay Millenium Problem: P = Np.Harvey M. Friedman - unknown
Fast-Growing Functions and the P vs. NP Question.Francisco Doria - 2007 - Logic Journal of the IGPL 15 (5-6):445-455.
A Class of Examples Demonstrating That 'P ≠ NP' in the 'P Vs NP' Problem.Vasil Penchev - 2020 - Computing Methodology eJournal (Elsevier: SSRN) 3 (19):1-19.
P≠NP, By considering time as a fuzzy concept.Didehvar Farzad - manuscript

Analytics

Added to PP
2024-11-21

Downloads
78 (#269,665)

6 months
78 (#78,937)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references