The P\(\neq\) NP conjecture in the context of real and complex analysis
From MaRDI portal
Publication:2489146
DOI10.1016/j.jco.2005.07.003zbMath1156.68387WikidataQ122877523 ScholiaQ122877523MaRDI QIDQ2489146
Jerzy Mycka, Costa, José Félix
Publication date: 16 May 2006
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2005.07.003
03F60: Constructive and recursive analysis
26A12: Rate of growth of functions, orders of infinity, slowly varying functions
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
A Survey on Analog Models of Computation, Computability on reals, infinite limits and differential equations, A foundation for real recursive function theory, A survey of recursive analysis and Moore's notion of real computation, Analog computation beyond the Turing limit
Cites Work
- Unnamed Item
- Unnamed Item
- Real recursive functions and their hierarchy
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Classical recursion theory. Vol. II
- Recursion theory on the reals and continuous-time computation
- \(\mu\)-recursion and infinite limits.
- Analog computers and recursive functions over the reals.
- Continuous-time computation with restricted integration capabilities
- An analog characterization of the Grzegorczyk hierarchy
- Undecidability over Continuous Time
- Fourier Analysis and Its Applications
- Machines, Computations, and Universality
- Machines, Computations, and Universality
- Iteration, inequalities, and differentiability in analog computers
