Continuous-time computation with restricted integration capabilities

DOI10.1016/j.tcs.2003.12.009zbMath1052.03019OpenAlexW2158775560MaRDI QIDQ1434373

Campagnolo, Manuel Lameiras

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.009

zbMATH Keywords

Computational complexityreal recursive functionsContinuous-time computationExponential space hierarchyrecursion theory on the reals

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Higher-type and set recursion theory (03D65)

Related Items

The P\(\neq\) NP conjecture in the context of real and complex analysis ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ A new conceptual framework for analog computation ⋮ A Survey on Analog Models of Computation

Cites Work

• Universal computation and other capabilities of hybrid and continuous dynamical systems
• A new recursion-theoretic characterization of the polytime functions
• Recursive function theory and numerical analysis
• Classical recursion theory. Vol. II
• Recursion theory on the reals and continuous-time computation
• An analog characterization of the Grzegorczyk hierarchy
• Classes of Predictably Computable Functions
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Iteration, inequalities, and differentiability in analog computers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item