Pages that link to "Item:Q1334658"
From MaRDI portal
The following pages link to Computability with low-dimensional dynamical systems (Q1334658):
Displaying 43 items.
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability (Q832033) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Topological formulation of termination properties of iterates of functions (Q1029041) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
- The simple dynamics of super Turing theories (Q1349873) (← links)
- Recursion theory on the reals and continuous-time computation (Q1349921) (← links)
- Analog computers and recursive functions over the reals. (Q1426051) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Timed-automata abstraction of switched dynamical systems using control invariants (Q1699229) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- Computability and Beltrami fields in Euclidean space (Q2109116) (← links)
- Deciding the point-to-fixed-point problem for skew tent maps on an interval (Q2208250) (← links)
- A decidable class of planar linear hybrid systems (Q2257303) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- On the complexity of bounded time and precision reachability for piecewise affine systems (Q2636516) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
- Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels (Q2945582) (← links)
- Reachability Problems for One-Dimensional Piecewise Affine Maps (Q3177337) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q3375307) (← links)
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (Q3447692) (← links)
- Diffusive Influence Systems (Q3449565) (← links)
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS (Q3526544) (← links)
- Chaos in computer performance (Q3529636) (← links)
- Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
- About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q4816928) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- On the Undecidability of the Tiling Problem (Q5448639) (← links)
- Iteration, inequalities, and differentiability in analog computers (Q5925968) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Deciding stability and mortality of piecewise affine dynamical systems (Q5941097) (← links)
- The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
- Welcoming the super Turing theories (Q6573925) (← links)