Robust non-computability of dynamical systems and computability of robust dynamical systems
Abstract
In this paper, we examine the relationship between the stability of the dynamical system and the computability of its basins of attraction. We present a computable system that possesses a computable and stable equilibrium point, yet whose basin of attraction is robustly non-computable in a neighborhood of in the sense that both the equilibrium point and the non-computability of its associated basin of attraction persist when is slightly perturbed. This indicates that local stability near a stable equilibrium point alone is insufficient to guarantee the computability of its basin of attraction. However, we also demonstrate that the basins of attraction associated with a structurally stable - globally stable (robust) - planar system defined on a compact set are computable. Our findings suggest that the global stability of a system and the compactness of the domain play a pivotal role in determining the computability of its basins of attraction.
Cite
@article{arxiv.2305.14448,
title = {Robust non-computability of dynamical systems and computability of robust dynamical systems},
author = {Daniel S. Graça and Ning Zhong},
journal= {arXiv preprint arXiv:2305.14448},
year = {2024}
}
Comments
arXiv admin note: text overlap with arXiv:2109.15080