Computability and computational complexity of the evolution of nonlinear dynamical systems

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nonlinear dynamical systems abound as models of natural phenomena. They are often characterized by highly unpredictable behaviour which is hard to analyze as it occurs, for example, in chaotic systems. A basic problem is to understand what kind of information we can realistically expect to extract from those systems, especially information concerning their long-term evolution. Here we review a few recent results which look at this problem from a computational perspective. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Bournez, O., Graça, D. S., Pouly, A., & Zhong, N. (2013). Computability and computational complexity of the evolution of nonlinear dynamical systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7921 LNCS, pp. 12–21). https://doi.org/10.1007/978-3-642-39053-1_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free