Pages that link to "Item:Q2581262"
From MaRDI portal
The following pages link to Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262):
Displaying 16 items.
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- The elementary computable functions over the real numbers: applying two new techniques (Q926178) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- Grzegorczyk's hierarchy of computable analysis (Q1575655) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computa (Q2790449) (← links)
- \(\mathcal M^2\)-computable real numbers (Q2907063) (← links)
- Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
- The Methods of Approximation and Lifting in Real Computation (Q4921452) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Automata, Languages and Programming (Q5466468) (← links)
- Machines, Computations, and Universality (Q5710897) (← links)
- Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)
