Pages that link to "Item:Q4491788"
From MaRDI portal
The following pages link to Unpredictability and undecidability in dynamical systems (Q4491788):
Displaying 40 items.
- A physically universal Turing machine (Q2678253) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- The impact of models of a physical oracle on computational power (Q2919942) (← links)
- Incomputability in Physics and Biology (Q2919943) (← links)
- AN ANALOGUE-DIGITAL CHURCH-TURING THESIS (Q2929623) (← links)
- Theory of hybrid dynamical systems and its applications to biological and medical systems (Q2997237) (← 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)
- SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY (Q3304645) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q3375307) (← links)
- ECONOPHYSICS AND ECONOMIC COMPLEXITY (Q3603959) (← links)
- Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
- Necessary and Sufficient Conditions for Quantum Computation (Q4490496) (← links)
- Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
- The complexity of N-body simulation (Q4630258) (← links)
- Nonlinear dynamics as an engine of computation (Q4644928) (← links)
- LANGUAGE PROCESSING BY DYNAMICAL SYSTEMS (Q4655588) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q4816928) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- Universal Neural Field Computation (Q4992856) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- The stochastic thermodynamics of computation (Q5053500) (← links)
- Undecidability of the Spectral Gap (Q5084676) (← links)
- A comparison of finite and cellular automata (Q5096907) (← links)
- A Universal Ordinary Differential Equation (Q5109517) (← links)
- Physical Computability Theses (Q5119662) (← links)
- Inverse problems in dynamic cognitive modeling (Q5251426) (← links)
- On dynamics of automata with a stack (Q5259053) (← links)
- Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
- ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION (Q5484835) (← links)
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (Q5493901) (← links)
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data (Q5738131) (← links)
- Identifying functional thermodynamics in autonomous Maxwellian ratchets (Q5854968) (← 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)
- Undecidable problems in quantum field theory (Q6049665) (← links)
- How real is incomputability in physics? (Q6549689) (← links)
- On principles of emergent organization (Q6571624) (← links)
- Piecewise integrable neural network: an interpretable chaos identification framework (Q6572660) (← links)
- Welcoming the super Turing theories (Q6573925) (← links)