Computable chaotic orbits

Joseph L. McCauley, Julian I Palmore

Research output: Contribution to journalArticle

Abstract

We contrast analytic properties of chaotic maps with the results of fixed-precision computation and then use Turing's ideas of computable irrational numbers to illustrate the computation of chaotic orbits to arbitrary N-bit precision. This leads to the study of chaos theory via integer maps that are automata with long-range site interactions. We also explain why the β-shadowing lemma is not a justification for the use of fixed-precision arithmetic in chaos theory.

Original languageEnglish (US)
Pages (from-to)433-436
Number of pages4
JournalPhysics Letters A
Volume115
Issue number9
DOIs
StatePublished - May 12 1986

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'Computable chaotic orbits'. Together they form a unique fingerprint.

  • Cite this

    McCauley, J. L., & Palmore, J. I. (1986). Computable chaotic orbits. Physics Letters A, 115(9), 433-436. https://doi.org/10.1016/0375-9601(86)90069-1