Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions

DOI10.1016/j.tcs.2005.09.010zbMath1087.03025OpenAlexW1985213782MaRDI QIDQ2581262

Emmanuel Hainry, Olivier Bournez

Publication date: 9 January 2006

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

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

zbMATH Keywords

analog computationrecursive analysiscomputabilityreal recursive functionsGrzegorczyk hierarchy

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (10)

Characterizing time computational complexity classes with polynomial differential equations ⋮ The elementary computable functions over the real numbers: applying two new techniques ⋮ Characterizing Computable Analysis with Differential Equations ⋮ The Methods of Approximation and Lifting in Real Computation ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ Computability on reals, infinite limits and differential equations ⋮ A foundation for real recursive function theory ⋮ A Survey on Analog Models of Computation

Cites Work

• Real recursive functions and their hierarchy
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Recursion theory on the reals and continuous-time computation
• \(\mu\)-recursion and infinite limits.
• Analog computers and recursive functions over the reals.
• An analog characterization of the Grzegorczyk hierarchy
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• Computable functionals
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Automata, Languages and Programming
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Mathematical Theory of the Differential Analyzer
• Achilles and the tortoise climbing up the arithmetical hierarchy
• Non-Turing computations via Malament--Hogarth space-times
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions