Characterizing Computable Analysis with Differential Equations

DOI10.1016/j.entcs.2008.12.004zbMath1262.03078OpenAlexW2095713767MaRDI QIDQ4918002

Kerry Ojakian, Campagnolo, Manuel Lameiras

Publication date: 3 May 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.004

zbMATH Keywords

differential equationscomputable analysisreal recursive functions

Mathematics Subject Classification ID

Related Items (2)

A survey of recursive analysis and Moore's notion of real computation ⋮ A characterization of computable analysis on unbounded domains using differential equations

Cites Work

• The elementary computable functions over the real numbers: applying two new techniques
• Recursion theory on the reals and continuous-time computation
• Analog computers and recursive functions over the reals.
• 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
• Using Approximation to Relate Computational Classes over the Reals
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• 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
• A Survey of Transcendentally Transcendental Functions
• Mathematical Theory of the Differential Analyzer
• Iteration, inequalities, and differentiability in analog computers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing Computable Analysis with Differential Equations