Quick search Find article
Quick search
Find article

Generalized shifts: unpredictability and undecidability in dynamical systems

C Moore

Show affiliations


A class of shift-like dynamical systems is presented that displays a wide variety of behaviours. Three examples are presented along with some general definitions and results. A correspondence with Turing machines allows one to discuss issues of predictability and complexity. These systems possess a type of unpredictability qualitatively stronger than that which has been previously discussed in the study of low-dimensional chaos, and many simple questions about their dynamics are undecidable. The author discusses the complexity of various sets they generate, including periodic points, basins of attraction, and time series. Finally, he shows that they can be embedded in smooth maps in R2, or smooth flows in R3.


PACS

05.45.Tp Time series analysis

05.45.Ac Low-dimensional chaos

02.70.Wz Symbolic computation (computer algebra)

02.10.De Algebraic structures and number theory

MSC

03D15 Complexity of computation (See also 68Q15, 68Q17)

03D35 Undecidability and degrees of sets of sentences

37Exx Low-dimensional dynamical systems

37M10 Time series analysis

03D10 Turing machines and related notions (See also 68Q05)

Subjects

Mathematical physics

Computational physics

Statistical physics and nonlinear systems

Dates

Issue 2 (May 1991)



View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.