Pages that link to "Item:Q4491788"
From MaRDI portal
The following pages link to Unpredictability and undecidability in dynamical systems (Q4491788):
Displaying 50 items.
- Computation with perturbed dynamical systems (Q355515) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- A dynamical model of parallel computation on bi-infinite time-scale (Q629413) (← links)
- Laplace's demon consults an oracle: the computational complexity of prediction (Q639767) (← links)
- Logic from nonlinear dynamical evolution (Q653543) (← links)
- Computability of entropy and information in classical Hamiltonian systems (Q653552) (← links)
- Universal computation and other capabilities of hybrid and continuous dynamical systems (Q673870) (← links)
- Infinite traces and symbolic dynamics (Q841627) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- Physical limits of inference (Q933440) (← links)
- Associative dynamics in a chaotic neural network. (Q960440) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- On topological dynamics of Turing machines (Q1269915) (← links)
- Homoclinic hyperchaos -- an explicit example (Q1312483) (← links)
- Computability and complexity of ray tracing (Q1327451) (← links)
- Complex systems, complexity measures, grammars and model-inferring (Q1331210) (← links)
- Computability with low-dimensional dynamical systems (Q1334658) (← links)
- Regular unimodal systems and factors of finite automata (Q1338217) (← links)
- On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
- The simple dynamics of super Turing theories (Q1349873) (← links)
- Reachability problems for sequential dynamical systems with threshold functions. (Q1401231) (← links)
- Number conserving cellular automata. II: Dynamics. (Q1401402) (← links)
- Analog computers and recursive functions over the reals. (Q1426051) (← links)
- Quantum automata and quantum grammars (Q1566730) (← links)
- The futility of utility: how market dynamics marginalize Adam Smith (Q1577068) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Computability in planar dynamical systems (Q1761693) (← links)
- From exactly solvable chaotic maps to stochastic dynamics (Q1860880) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Chaotic and stochastic phenomena in systems with non-invertible nonlinearities (Q1878229) (← links)
- Universal computation and physical dynamics (Q1896542) (← links)
- Nonlinearity and computation: Implementing logic as a nonlinear dynamical system (Q1967048) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- Excitable media store and transfer complicated information via topological defect motion (Q2094460) (← links)
- Computability and Beltrami fields in Euclidean space (Q2109116) (← links)
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval (Q2176543) (← links)
- More really is different (Q2389362) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- Computational universes (Q2483574) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Church's thesis meets the \(N\)-body problem (Q2497884) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
