An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
From MaRDI portal
Publication:905698
DOI10.1007/s00224-015-9609-5zbMath1336.03051arXiv1409.1163OpenAlexW2150004712MaRDI QIDQ905698
Ning Zhong, Daniel Silva Graça
Publication date: 28 January 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.1163
reachability problembasins of attractionsasymptotically stable equilibrium pointscomputability with real numbers
Stability of solutions to ordinary differential equations (34D20) Approximation methods and numerical treatment of dynamical systems (37M99) Turing machines and related notions (03D10) Computation over the reals, computable analysis (03D78)
Related Items
Cites Work
- Estimation of domains of attraction: A global optimization approach
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Classical recursion theory. The theory of functions and sets of natural numbers
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Estimating the domain of attraction for uncertain polynomial systems
- Computability with polynomial differential equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Computational unsolvability of domains of attraction of nonlinear systems
- Non-computable Julia sets
- Differentiable dynamical systems
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Iteration, inequalities, and differentiability in analog computers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
