Tight space-noise tradeoffs in computing the ergodic measure

DOI10.1070/SM8884zbMath1390.68335arXiv1508.05372OpenAlexW2963311068MaRDI QIDQ4610200

Cristobal Rojas, Mark Braverman, Jon Schneider

Publication date: 6 April 2018

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.05372

zbMATH Keywords

dynamical systemsspace-bounded computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Ergodicity, mixing, rates of mixing (37A25) Matrix exponential and similar functions of matrices (15A16)

Related Items (2)

Computability and Beltrami fields in Euclidean space ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamics and abstract computability: computing invariant measures
• Computability of Brolin-Lyubich measure
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Relationships between nondeterministic and deterministic tape complexities
• An efficient algorithm for the complex roots problem
• Noise vs computational intractability in dynamics
• Rigorous computation of invariant measures and fractal dimension for maps with contracting fibers: 2D Lorenz-like maps
• Constructing non-computable Julia sets
• Structure and importance of logspace-MOD class
• Using Ulam's method to calculate entropy and other dynamical invariants
• Unpredictability and undecidability in dynamical systems
• Non-computable Julia sets
• Existence of noise induced order, a computer aided proof
• Polynomial minimum root separation

This page was built for publication: Tight space-noise tradeoffs in computing the ergodic measure