Pages that link to "Item:Q5201938"
From MaRDI portal
The following pages link to Generalized shifts: unpredictability and undecidability in dynamical systems (Q5201938):
Displaying 42 items.
- Laplace's demon consults an oracle: the computational complexity of prediction (Q639767) (← links)
- Universal computation and other capabilities of hybrid and continuous dynamical systems (Q673870) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- Optical computing (Q1036535) (← 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)
- Complex systems, complexity measures, grammars and model-inferring (Q1331210) (← links)
- Computability with low-dimensional dynamical systems (Q1334658) (← links)
- Dynamically changing interface as a model of measurement in complex systems (Q1349371) (← 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)
- On the presence of periodic configurations in Turing machines and in counter machines. (Q1853547) (← links)
- Bootstrapping system defined by inconsistent relation between Boolean and non-Boolean algebra (Q1923377) (← links)
- Queues, stacks, and transcendentality at the transition to chaos (Q1961669) (← links)
- Intermingled basins of attraction: uncomputability in a simple physical system (Q1967873) (← links)
- Excitable media store and transfer complicated information via topological defect motion (Q2094460) (← links)
- Computability and Beltrami fields in Euclidean space (Q2109116) (← links)
- When good theories make bad predictions (Q2460156) (← links)
- Analog computation beyond the Turing limit (Q2497879) (← 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)
- The Transitivity Problem of Turing Machines (Q2946339) (← links)
- Undecidability in <b>R</b><sup><i>n</i></sup>: Riddled Basins, the KAM Tori, and the Stability of the Solar System (Q3093489) (← links)
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (Q3447692) (← links)
- A NOTE ON GENERALISED SHIFTS (Q4236504) (← links)
- Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
- LANGUAGE PROCESSING BY DYNAMICAL SYSTEMS (Q4655588) (← links)
- Universal Neural Field Computation (Q4992856) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Inverse problems in dynamic cognitive modeling (Q5251426) (← links)
- Dynamics of a quasi-quadratic map (Q5746466) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- The origin of universality: making and invalidating a free category (Q5938560) (← 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)
- On relations between properties in transitive Turing machines (Q6058472) (← links)
- Looking at Euler flows through a contact mirror: universality and undecidability (Q6064566) (← links)
- Welcoming the super Turing theories (Q6573925) (← links)
- Quantum-fluid correspondence in relativistic fluids with spin: from Madelung form to gravitational coupling (Q6671034) (← links)
