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

10/21/2019
by   Cristobal Rojas, et al.
0

We consider the simplest non-linear discrete dynamical systems, given by the logistic maps f_a(x)=ax(1-x) of the interval [0,1]. We show that there exist real parameters a∈ (0,4) for which almost every orbit of f_a has the same statistical distribution in [0,1], but this limiting distribution is not Turing computable. In particular, the Monte Carlo method cannot be applied to study these dynamical systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2022

What's Decidable about Discrete Linear Dynamical Systems?

We survey the state of the art on the algorithmic analysis of discrete l...
research
08/21/2011

A Dynamical Systems Approach for Static Evaluation in Go

In the paper arguments are given why the concept of static evaluation ha...
research
01/31/2020

Efficient computation of extreme excursion probabilities for dynamical systems

We develop a novel computational method for evaluating the extreme excur...
research
05/23/2023

Robust non-computability and stability of dynamical systems

In this paper, we examine the relationship between the stability of the ...
research
04/26/2023

The physical Church thesis and the sensitivity to initial conditions

The physical Church thesis is a thesis about nature that expresses that ...
research
05/02/2023

Cheap and Deterministic Inference for Deep State-Space Models of Interacting Dynamical Systems

Graph neural networks are often used to model interacting dynamical syst...
research
10/06/2021

Distribution Preserving Multiple Hypotheses Prediction for Uncertainty Modeling

Many supervised machine learning tasks, such as future state prediction ...

Please sign up or login with your details

Forgot password? Click here to reset