2023/04/01 by Czerwinski, Reiner
#03D15 #68Q15 #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.2305.02226
The P versus NP problem is still unsolved. But there are several oracles with P unequal NP relative to them. Here we will prove, that P\not=NP relative to a P-complete oracle. In this paper, we use padding arguments as the proof method. The padding arguments are not bounded by a computable function. Such as we can use methods from computability theory to separate complexity classes.