How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable

DOI10.1145/3357713.3384237MaRDI QIDQ5144992zbMATH OpenOpenAlexFDO

Authors Cristobal Rojas, Michael Yampolsky

Publication date 19 January 2021

Published in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

logistic familyMonte Carlo simulationnon-computabilityphysical measures

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• Towards understanding the theoretical challenges of numerical modeling of dynamical systems
• Sporadicity: Between periodic and chaotic dynamical behaviors
• How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable
• Robust non-computability of dynamical systems and computability of robust dynamical systems
• On the algorithmic descriptive complexity of attractors in topological dynamics

This page was built for publication: How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144992)