A characterization of computable analysis on unbounded domains using differential equations

DOI10.1016/J.IC.2011.04.002zbMATH Open1247.03097OpenAlexW2147410830MaRDI QIDQ719239FDOQ719239

Authors: Kerry Ojakian, Manuel Lameiras Campagnolo 

Publication date: 10 October 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.04.002

Recommendations

• Characterizing Computable Analysis with Differential Equations
• Automata, Languages and Programming
• Recursive analysis characterized as a class of real recursive functions
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• New Computational Paradigms

zbMATH Keywords

differential equationsapproximationcomputable analysisanalog computationfunction algebrasreal recursive functions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursion theory on the reals and continuous-time computation
• Analog computers and recursive functions over the reals.
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Mathematical Theory of the Differential Analyzer
• A survey on continuous time computations
• Title not available (Why is that?)
• Computable functionals
• Feasible real random access machines
• A domain-theoretic approach to computability on the real line
• Differential recursion
• An analog characterization of the Grzegorczyk hierarchy
• A foundation for real recursive function theory
• Recursive characterization of computable real-valued functions and relations
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
• Recursive analysis characterized as a class of real recursive functions
• Using Approximation to Relate Computational Classes over the Reals
• Characterizing Computable Analysis with Differential Equations
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• The elementary computable functions over the real numbers: applying two new techniques

Cited In (4)

• A new characterization of computable functions
• Characterizing Computable Analysis with Differential Equations
• Dynamic analysis of unbounded domains by a reduced set of base functions
• Recursive analysis characterized as a class of real recursive functions

This page was built for publication: A characterization of computable analysis on unbounded domains using differential equations

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