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)

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Low-dimensional dynamical systems (37E99) Turing machines and related notions (03D10)

Related Items (86)

An analog characterization of the Grzegorczyk hierarchy ⋮ Computability and complexity of ray tracing ⋮ Complex systems, complexity measures, grammars and model-inferring ⋮ Chaotic and stochastic phenomena in systems with non-invertible nonlinearities ⋮ Computability with low-dimensional dynamical systems ⋮ Regular unimodal systems and factors of finite automata ⋮ Infinite traces and symbolic dynamics ⋮ The stochastic thermodynamics of computation ⋮ On the computational power of dynamical systems and hybrid systems ⋮ The simple dynamics of super Turing theories ⋮ Computability and Dynamical Systems ⋮ Universal computation and physical dynamics ⋮ Complexity of reachability problems for finite discrete dynamical systems ⋮ More really is different ⋮ The impact of models of a physical oracle on computational power ⋮ Incomputability in Physics and Biology ⋮ Computation with perturbed dynamical systems ⋮ AN ANALOGUE-DIGITAL CHURCH-TURING THESIS ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Undecidability of the Spectral Gap ⋮ Computability of topological entropy: from general systems to transformations on Cantor sets and the interval ⋮ An RNA-based theory of natural universal computation ⋮ A comparison of finite and cellular automata ⋮ Undecidable problems in quantum field theory ⋮ A physically universal Turing machine ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Number conserving cellular automata. II: Dynamics. ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ A dynamical model of parallel computation on bi-infinite time-scale ⋮ Physical Computability Theses ⋮ Laplace's demon consults an oracle: the computational complexity of prediction ⋮ Tight space-noise tradeoffs in computing the ergodic measure ⋮ Undecidable event detection problems for ODEs of dimension one and two ⋮ Analog computers and recursive functions over the reals. ⋮ Logic from nonlinear dynamical evolution ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ Nonlinearity and computation: Implementing logic as a nonlinear dynamical system ⋮ Undecidability and incompleteness in classical mechanics ⋮ The complexity of N-body simulation ⋮ Analog computation through high-dimensional physical chaotic neuro-dynamics ⋮ Physical limits of inference ⋮ Theory of hybrid dynamical systems and its applications to biological and medical systems ⋮ SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY ⋮ Universal computation and other capabilities of hybrid and continuous dynamical systems ⋮ Nonlinear dynamics as an engine of computation ⋮ Iteration, inequalities, and differentiability in analog computers ⋮ A survey of computational complexity results in systems and control ⋮ Associative dynamics in a chaotic neural network. ⋮ LANGUAGE PROCESSING BY DYNAMICAL SYSTEMS ⋮ Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs ⋮ Computability with polynomial differential equations ⋮ Computability in planar dynamical systems ⋮ Computational universes ⋮ The Spacey Random Walk: A Stochastic Process for Higher-Order Data ⋮ Deciding stability and mortality of piecewise affine dynamical systems ⋮ A Universal Ordinary Differential Equation ⋮ Computability, noncomputability, and hyperbolic systems ⋮ 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 ⋮ Experimental computation of real numbers by Newtonian machines ⋮ ECONOPHYSICS AND ECONOMIC COMPLEXITY ⋮ Continuous-Time Symmetric Hopfield Nets Are Computationally Universal ⋮ On topological dynamics of Turing machines ⋮ A new conceptual framework for analog computation ⋮ Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System ⋮ ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION ⋮ Quantum automata and quantum grammars ⋮ 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 ⋮ ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS ⋮ Universal Neural Field Computation ⋮ The futility of utility: how market dynamics marginalize Adam Smith ⋮ Necessary and Sufficient Conditions for Quantum Computation ⋮ Inverse problems in dynamic cognitive modeling ⋮ Analog computation with dynamical systems ⋮ Identifying functional thermodynamics in autonomous Maxwellian ratchets ⋮ Excitable media store and transfer complicated information via topological defect motion ⋮ On dynamics of automata with a stack ⋮ Homoclinic hyperchaos -- an explicit example ⋮ A theory of complexity for continuous time systems ⋮ From exactly solvable chaotic maps to stochastic dynamics ⋮ Computability and Beltrami fields in Euclidean space ⋮ Continuous-Time Symmetric Hopfield Nets Are Computationally Universal ⋮ A Survey on Analog Models of Computation

Cites Work

This page was built for publication: Unpredictability and undecidability in dynamical systems