The elementary computable functions over the real numbers: applying two new techniques

DOI10.1007/S00153-007-0059-XzbMath1141.03016OpenAlexW2088914813MaRDI QIDQ926178

Kerry Ojakian, Campagnolo, Manuel Lameiras

Publication date: 26 May 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-007-0059-x

zbMATH Keywords

Computable analysisElementary computable functionsReal recursive functions

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (5)

Characterizing Computable Analysis with Differential Equations ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ A foundation for real recursive function theory ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Real recursive functions and their hierarchy
• Recursion theory on the reals and continuous-time computation
• \(\mu\)-recursion and infinite limits.
• An analog characterization of the Grzegorczyk hierarchy
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Some recent developments on Shannon's General Purpose Analog Computer
• Computable functionals
• The Methods of Approximation and Lifting in Real Computation

This page was built for publication: The elementary computable functions over the real numbers: applying two new techniques