Computational unsolvability of domains of attraction of nonlinear systems

@inproceedings{Zhong2009ComputationalUO,
  title={Computational unsolvability of domains of attraction of nonlinear systems},
  author={Ning Zhong},
  year={2009}
}
Let S be the domain of attraction of a computable and asymptotically stable hyperbolic equilibrium point of the non-linear system x = f(x). We show that the problem of determining S is computationally unsolvable. We also present an upper bound of the degree of unsolvability of this problem. 

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Computable Analysis

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Complexity Theory of Real Functions

K. Ko
  • Progress in Theoretical Computer Science. Birkhäuser, Boston,
  • 1991
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Computational complexity of fractals

K. Ko
  • Proceedings of the 7th and 8th Asian Logic Conferences, pp. 252–269, Singapore Univ. Press, Singapore,
  • 2003