Unpredictability and undecidability in dynamical systems

DOI10.1103/PhysRevLett.64.2354zbMath1050.37510WikidataQ27343172 ScholiaQ27343172MaRDI QIDQ4491788

Publication date: 16 July 2000

Published in: Physical Review Letters (Search for Journal in Brave)

37D45: Strange attractors, chaotic dynamics of systems with hyperbolic behavior

37E99: Low-dimensional dynamical systems

03D10: Turing machines and related notions

Related Items

Undecidable event detection problems for ODEs of dimension one and two, Necessary and Sufficient Conditions for Quantum Computation, LANGUAGE PROCESSING BY DYNAMICAL SYSTEMS, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, Experimental computation of real numbers by Newtonian machines, ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION, ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS, Iteration, inequalities, and differentiability in analog computers, A survey of computational complexity results in systems and control, Deciding stability and mortality of piecewise affine dynamical systems, Universal computation and other capabilities of hybrid and continuous dynamical systems, Infinite traces and symbolic dynamics, Complexity of reachability problems for finite discrete dynamical systems, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Analog computation through high-dimensional physical chaotic neuro-dynamics, Physical limits of inference, Associative dynamics in a chaotic neural network., A new conceptual framework for analog computation, Computations via Newtonian and relativistic kinematic systems, What is a universal computing machine?, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Undecidability and incompleteness in classical mechanics, On topological dynamics of Turing machines, Homoclinic hyperchaos -- an explicit example, Computability and complexity of ray tracing, Complex systems, complexity measures, grammars and model-inferring, Computability with low-dimensional dynamical systems, Regular unimodal systems and factors of finite automata, On the computational power of dynamical systems and hybrid systems, The simple dynamics of super Turing theories, Reachability problems for sequential dynamical systems with threshold functions., Number conserving cellular automata. II: Dynamics., Analog computers and recursive functions over the reals., Quantum automata and quantum grammars, The futility of utility: how market dynamics marginalize Adam Smith, Analog computation with dynamical systems, A theory of complexity for continuous time systems, From exactly solvable chaotic maps to stochastic dynamics, An analog characterization of the Grzegorczyk hierarchy, Chaotic and stochastic phenomena in systems with non-invertible nonlinearities, Universal computation and physical dynamics, Nonlinearity and computation: Implementing logic as a nonlinear dynamical system, More really is different, Computability with polynomial differential equations, Computational universes, Embedding infinitely parallel computation in Newtonian kinematics, How much can analog and hybrid systems be proved (super-)Turing, Church's thesis meets the \(N\)-body problem, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, ECONOPHYSICS AND ECONOMIC COMPLEXITY

Cites Work