scientific article; zbMATH DE number 2013793

MaRDI QIDQ4437079zbMATH OpenFDO

Authors Manuel Lameiras Campagnolo

Publication date 7 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2509/25090001.htm

zbMATH Keywords

computational complexityContinuous-time computationdifferential equationsrecursion theory

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65)

Recommendations

• A foundation for real recursive function theory
• Continuous-time computation with restricted integration capabilities
• Recursion theory on the reals and continuous-time computation
• scientific article; zbMATH DE number 4023258
• Real recursive functions and their hierarchy

Cited in

(21)

• A foundation for real recursive function theory
• Computational bounds on polynomial differential equations
• Relatively recursive reals and real functions
• Recursion theory on the reals and continuous-time computation
• Continuous-time computation with restricted integration capabilities
• Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
• A survey of recursive analysis and Moore's notion of real computation
• Beyond recursive real functions
• The intrinsic difficulty of recursive functions
• Polynomial time over the reals with parsimony
• Computability with polynomial differential equations
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1354146 (Why is no real title available?)
• scientific article; zbMATH DE number 782018 (Why is no real title available?)
• A Survey on Analog Models of Computation
• scientific article; zbMATH DE number 3353266 (Why is no real title available?)
• Algorithms and Computation
• Robust non-computability of dynamical systems and computability of robust dynamical systems
• Real recursive functions and their hierarchy
• On a complexity-based way of constructivizing the recursive functions
• Computability on reals, infinite limits and differential equations

This page was built for publication:

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