Inductive Complexity of P versus NP Problem [chapter]

Cristian S. Calude, Elena Calude, Melissa S. Queen
2012 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-32894-7_2 fatcat:cyv5wgexyzf7li4ns6lncnntti