Pages that link to "Item:Q5943100"
From MaRDI portal
The following pages link to The stability of saturated linear dynamical systems is undecidable (Q5943100):
Displayed 18 items.
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Transiently chaotic neural networks with piecewise linear output functions (Q711939) (← links)
- Topological formulation of termination properties of iterates of functions (Q1029041) (← links)
- Computability in planar dynamical systems (Q1761693) (← links)
- On the presence of periodic configurations in Turing machines and in counter machines. (Q1853547) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
- Deciding the point-to-fixed-point problem for skew tent maps on an interval (Q2208250) (← links)
- On the complexity of bounded time and precision reachability for piecewise affine systems (Q2636516) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- Reachability Problems for One-Dimensional Piecewise Affine Maps (Q3177337) (← links)
- On the geometry and regularity of invariant sets of piecewise-affine automorphisms on the Euclidean space (Q3298422) (← links)
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (Q3447692) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- (Q5089184) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Exponential asymptotic optimality of Whittle index policy (Q6164144) (← links)