An Argument for P = NP

Minds and Machines 27 (4):663-672 (2017)
  Copy   BIBTEX

Abstract

I articulate a novel modal argument for P=NP.

Categories

Keywords

Reprint years

DOI

10.1007/s11023-017-9454-1

Other Versions

manuscript Bringsjord, Selmer (manuscript) "An argument for P=NP".

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,297

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Commentary on Bringsjord on P = NP.Michael Wooldridge, Peter Millican & Paula Boddington - 2017 - Minds and Machines 27 (4):673-678.
The Philosophical Ontological Proof for P=NP.Alan T. Ho - manuscript
Selmer Bringsjord, What Robots Can and Can't Be, Studies in Cognitive Systems. [REVIEW]Larry Hauser - 1997 - Minds and Machines 7 (3):433-438.
Clay Millenium Problem: P = Np.Harvey M. Friedman - unknown
Consequences of the Provability of NP ⊆ P/poly.Stephen Cook & Jan Krajíček - 2007 - Journal of Symbolic Logic 72 (4):1353 - 1371.
Selmer Bringsjord, What Robots Can and Can't Be, Studies in Cognitive Systems. [REVIEW]Hauser Larry - 1997 - Minds and Machines 7 (3):433-438.
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 for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
P^f NP^f for almost all f.J. D. Hamkins - 2003 - Mathematical Logic Quarterly 49 (5):536.

Analytics

Added to PP
2017-11-25

Downloads
49 (#450,909)

6 months
3 (#1,480,774)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Selmer Bringsjord
Rensselaer Polytechnic Institute

Citations of this work

Add more citations

References found in this work

Modal Logic: An Introduction.Brian F. Chellas - 1980 - New York: Cambridge University Press.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
An Introduction to Modal Logic.George Edward Hughes & M. J. Cresswell - 1968 - London, England: Methuen. Edited by M. J. Cresswell.

View all 18 references / Add more references