Structural complexity 1
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
Computable analysis: an introduction
Computable analysis: an introduction
Iteration, inequalities, and differentiability in analog computers
Journal of Complexity
Analog and Hybrid Computing
An analog characterization of the Grzegorczyk hierarchy
Journal of Complexity
µ-recursion and infinite limits
Theoretical Computer Science
Analog computers and recursive functions over the reals
Journal of Complexity
Continuous-time computation with restricted integration capabilities
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Real recursive functions and their hierarchy
Journal of Complexity
Real recursive functions and real extensions of recursive functions
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The computational power of continuous dynamic systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Using approximation to relate computational classes over the reals
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Hi-index | 0.00 |
In this paper, we aim at an analog characterization of the classical P ≠ 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 ≠ NAnalog then P ≠ NP.