Noise vs computational intractability in dynamics

DOI10.1145/2090236.2090247zbMath1347.68122arXiv1201.0488OpenAlexW2057028182WikidataQ130970083 ScholiaQ130970083MaRDI QIDQ2826049

Alexander Grigo, Mark Braverman, Cristobal Rojas

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

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

zbMATH Keywords

robustnessperturbationpredictabilityinvariant distributionsuncomputability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Ergodicity, mixing, rates of mixing (37A25) General topics in the theory of computing (68Q01)

Related Items (5)

Tight space-noise tradeoffs in computing the ergodic measure ⋮ Towards understanding the theoretical challenges of numerical modeling of dynamical systems ⋮ Mutation, Sexual Reproduction and Survival in Dynamic Environments ⋮ Existence of noise induced order, a computer aided proof ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: Noise vs computational intractability in dynamics