Recursive analysis characterized as a class of real recursive functions
From MaRDI portal
Recommendations
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Automata, Languages and Programming
- Machines, Computations, and Universality
- A characterization of computable analysis on unbounded domains using differential equations
- Real recursive functions and their hierarchy
Cited in
(18)- A foundation for real recursive function theory
- Recursive characterization of computable real-valued functions and relations
- A survey of recursive analysis and Moore's notion of real computation
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Distributed Learning of Wardrop Equilibria
- scientific article; zbMATH DE number 1191235 (Why is no real title available?)
- Order-free Recursion on the Real Numbers
- scientific article; zbMATH DE number 1018349 (Why is no real title available?)
- scientific article; zbMATH DE number 1746045 (Why is no real title available?)
- Characterizing Computable Analysis with Differential Equations
- The methods of approximation and lifting in real computation
- A Survey on Analog Models of Computation
- A recursion theoretic foundation of computation over real numbers
- Automata, Languages and Programming
- Machines, Computations, and Universality
- Real recursive functions and their hierarchy
- A characterization of computable analysis on unbounded domains using differential equations
- The elementary computable functions over the real numbers: applying two new techniques
This page was built for publication: Recursive analysis characterized as a class of real recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416089)
