Back to Search
Start Over
INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM.
- Source :
-
Parallel Processing Letters . Mar2013, Vol. 23 Issue 1, p-1. 16p. 1 Chart. - Publication Year :
- 2013
-
Abstract
- This paper does not propose a solution, not even a new possible attack, to the P versus NP problem. We are asking the simpler question: How 'complex' is the P versus NP problem? Using the inductive complexity measure-a measure based on computations run by inductive register machines of various orders-developed in [2], we determine an upper bound on the inductive complexity of second order of the P versus NP problem. From this point of view, the P versus NP problem is significantly more complex than the Riemann hypothesis. To date, the P versus NP problem and the Goostein theorem (which is unprovable in Peano Arithmetic) are the most complex mathematical statements (theorems, conjectures and problems) studied in this framework [9, 5, 6, 2, 20]. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01296264
- Volume :
- 23
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Parallel Processing Letters
- Publication Type :
- Academic Journal
- Accession number :
- 86407671
- Full Text :
- https://doi.org/10.1142/S0129626413500072