Continuous-time computation with restricted integration capabilities

DOI10.1016/J.TCS.2003.12.009MaRDI QIDQ1434373zbMATH OpenOpenAlexFDO

Authors Manuel Lameiras Campagnolo

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

Recommendations

• Recursion theory on the reals and continuous-time computation
• scientific article; zbMATH DE number 2013793
• A survey of recursive analysis and Moore's notion of real computation
• scientific article; zbMATH DE number 1583876
• Real recursive functions and their hierarchy

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1246413 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• scientific article; zbMATH DE number 1008514 (Why is no real title available?)
• scientific article; zbMATH DE number 806743 (Why is no real title available?)
• scientific article; zbMATH DE number 1390027 (Why is no real title available?)
• scientific article; zbMATH DE number 3204015 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3182507 (Why is no real title available?)
• A new recursion-theoretic characterization of the polytime functions
• An analog characterization of the Grzegorczyk hierarchy
• Classes of Predictably Computable Functions
• Classical recursion theory. Vol. II
• Iteration, inequalities, and differentiability in analog computers
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Recursion theory on the reals and continuous-time computation
• Recursive function theory and numerical analysis
• Universal computation and other capabilities of hybrid and continuous dynamical systems

Cited in

(6)

• scientific article; zbMATH DE number 2013793 (Why is no real title available?)
• A Survey on Analog Models of Computation
• scientific article; zbMATH DE number 1583876 (Why is no real title available?)
• A new conceptual framework for analog computation
• How much can analog and hybrid systems be proved (super-)Turing
• The P\(\neq\) NP conjecture in the context of real and complex analysis

This page was built for publication: Continuous-time computation with restricted integration capabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434373)