The P≠NP conjecture in the context of real and complex analysis

Authors:
Jerzy Mycka;José Félix Costa
Affiliations:
Institute of Mathematics, University of Maria Curie-Sklodowska, Lublin, Poland;Department of Mathematics, I.S.T., Universidade Técnica de Lisboa, Lisboa, Portugal
Venue:
Journal of Complexity
Year:
2006

Citing 12
Cited 2

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

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

The New Promise of Analog Computation

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A survey of recursive analysis and Moore's notion of real computation

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we aim at an analog characterization of the classical PNP 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 DAnalogNAnalog then PNP.