Inductive complexity of p versus NP problem

Authors:
Cristian S. Calude;Elena Calude;Melissa S. Queen
Affiliations:
Department of Computer Science, University of Auckland, Auckland, New Zealand,Isaac Newton Institute for Mathematical Sciences, Cambridge, United Kingdom;Institute of Information and Mathematical Sciences, Massey University at Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand,Dartmouth College, New Hampshire
Venue:
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Year:
2012

Citing 11
Cited 0

Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Information and Randomness: An Algorithmic Perspective

Information and Randomness: An Algorithmic Perspective
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms

IEEE Annals of the History of Computing
The status of the P versus NP problem

Communications of the ACM - The Status of the P versus NP Problem
Super-Recursive Algorithms

Super-Recursive Algorithms
The Nature of Computation

The Nature of Computation
The GCT program toward the P vs. NP problem

Communications of the ACM
A program-size complexity measure for mathematical problems and conjectures

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
The complexity of Euler's integer partition theorem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the complexity measure developed in [7,3,4] and the extensions obtained by using inductive register machines of various orders in [1,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 more complex than the Riemann hypothesis.