ROBUST NON-COMPUTABILITY OF DYNAMICAL SYSTEMS AND COMPUTABILITY OF ROBUST DYNAMICAL SYSTEMS

被引:1
作者
Graca, Daniel S. [1 ,2 ]
Zhong, Ning [3 ]
机构
[1] Univ Algarve, C Gambelas, P-8005139 Faro, Portugal
[2] Inst Telecomunicacoes, P-1049001 Lisbon, Portugal
[3] Univ Cincinnati, DMS, Cincinnati, OH 45221 USA
关键词
non-computability; basin of attraction; dynamical systems; ordinary differential equations; structural stability; UNIQUE SOLUTION; WAVE-EQUATION; INITIAL DATA; NONCOMPUTABILITY; ATTRACTION; SETS;
D O I
10.46298/LMCS-20(2:19)2024
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we examine the relationship between the stability of the dynamical system x ' = f ( x ) and the computability of its basins of attraction. We present a computable C infinity system x ' = 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 (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.
引用
收藏
页数:27
相关论文
共 34 条
  • [1] Birkhoff G., 1989, Ordinary differential equations
  • [2] Turing Meets Circuit Theory: Not Every Continuous-Time LTI System Can be Simulated on a Digital Computer
    Boche, Holger
    Pohl, Volker
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2020, 67 (12) : 5051 - 5064
  • [3] UNIVERSAL COMPUTATION AND OTHER CAPABILITIES OF HYBRID AND CONTINUOUS DYNAMICAL-SYSTEMS
    BRANICKY, MS
    [J]. THEORETICAL COMPUTER SCIENCE, 1995, 138 (01) : 67 - 100
  • [4] Brattka V., 2008, A Tutorial on Computable Analysis, P425
  • [5] Non-computable Julia sets
    Braverman, M.
    Yampolsky, M.
    [J]. JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 2006, 19 (03) : 551 - 578
  • [6] Campagnolo ML, 2002, LECT NOTES COMPUT SC, V2509, P1
  • [7] An analog characterization of the Grzegorczyk hierarchy
    Campagnolo, ML
    Moore, C
    Costa, JF
    [J]. JOURNAL OF COMPLEXITY, 2002, 18 (04) : 977 - 1000
  • [8] Iteration, inequalities, and differentiability in analog computers
    Campagnolo, ML
    [J]. JOURNAL OF COMPLEXITY, 2000, 16 (04) : 642 - 660
  • [9] Turing Universality of the Incompressible Euler Equations and a Conjecture of Moore
    Cardona, Robert
    Miranda, Eva
    Peralta-Salas, Daniel
    [J]. INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2022, 2022 (22) : 18092 - 18109
  • [10] Constructing Turing complete Euler flows in dimension 3
    Cardona, Robert
    Miranda, Eva
    Peralta-Salas, Daniel
    Presas, Francisco
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2021, 118 (19)