Pages that link to "Item:Q5466468"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466468):
Displaying 11 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)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Analog computers and recursive functions over the reals. (Q1426051) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Analog computation beyond the Turing limit (Q2497879) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- (Q4263799) (← links)
- (Q4993805) (← links)
- Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)