Pages that link to "Item:Q1274806"
From MaRDI portal
The following pages link to Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806):
Displaying 22 items.
- Computing with polynomial ordinary differential equations (Q306694) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Some bounds on the computational power of piecewise constant derivative systems (Q1277365) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Classes of timed automata and the undecidability of universality (Q2842589) (← links)
- Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo (Q2870135) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- (Q5094870) (← links)
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← links)
- (Q5871546) (← links)
- Achilles and the tortoise climbing up the arithmetical hierarchy (Q5906326) (← links)
- Iteration, inequalities, and differentiability in analog computers (Q5925968) (← links)
- (Q6046173) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
