Robust non-computability and stability of dynamical systems

From MaRDI portal
Publication:6510243

arXiv2305.14448MaRDI QIDQ6510243FDOQ6510243


Authors: Daniel Graça, Ning Zhong Edit this on Wikidata



Abstract: In this paper, we examine the relationship between the stability of the dynamical system xprime=f(x) and the computability of its basins of attraction. We present a computable Cinfty system xprime=f(x) that possesses a computable and stable equilibrium point, yet whose basin of attraction is robustly non-computable in a neighborhood of f in the sense that both the equilibrium point and the non-computability of its associated basin of attraction persist when f 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 - planar system are computable. Our findings suggest that the global stability of a system plays a pivotal role in determining the computability of its basins of attraction.













This page was built for publication: Robust non-computability and stability of dynamical systems

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