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
相关论文
共 50 条
  • [1] Computability and Dynamical Systems
    Buescu, J.
    Graca, D. S.
    Zhong, N.
    DYNAMICS, GAMES AND SCIENCE I, 2011, 1 : 169 - 181
  • [2] Computability and discrete dynamical systems
    Sieg, W
    NEW COMPUTATIONAL PARADIGMS, 2005, 3526 : 440 - 440
  • [3] Computability in planar dynamical systems
    Graca, Daniel
    Zhong, Ning
    NATURAL COMPUTING, 2011, 10 (04) : 1295 - 1312
  • [4] Computability in planar dynamical systems
    Daniel Graça
    Ning Zhong
    Natural Computing, 2011, 10 : 1295 - 1312
  • [5] COMPUTABILITY AND NON-COMPUTABILITY IN CLASSICAL-ANALYSIS
    POUREL, MB
    RICHARDS, I
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1983, 275 (02) : 539 - 560
  • [6] COMPUTABILITY WITH LOW-DIMENSIONAL DYNAMICAL-SYSTEMS
    KOIRAN, P
    COSNARD, M
    GARZON, M
    THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 113 - 128
  • [7] Non-computability of competitive equilibrium
    Marcel K. Richter
    Kam-Chau Wong
    Economic Theory, 1999, 14 : 1 - 27
  • [8] Quasiperiodicity and Non-computability in Tilings
    Durand, Bruno
    Romashchenko, Andrei
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 218 - 230
  • [9] Non-computability of competitive equilibrium
    Richter, MK
    Wong, KC
    ECONOMIC THEORY, 1999, 14 (01) : 1 - 27
  • [10] On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers
    Boche, Holger
    Pohl, Volker
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5561 - 5578