The P not equal NP conjecture in the context of real and complex analysis
In this paper, we aim at an analog characterization of the classical P not equal NP conjecture of Structural Complexity. We consider functions over continuous real and complex valued variables. Subclasses of functions can be defined using Laplace transforms adapted to continuous-time Computation, introducing analog classes DAnalog and NAnalog. We then show that if DAnalog not equal NAnalog then P not equal NP. (c) 2005 Elsevier Inc. All rights reserved.
structural complexity analog computation real recursive functions