article

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

Authors:

Stefano Galatolo,

Mathieu Hoyrup,

Cristóbal RojasAuthors Info & Claims

Information and Computation, Volume 208, Issue 1

Pages 23 - 41

https://doi.org/10.1016/j.ic.2009.05.001

Published: 01 January 2010 Publication History

Abstract

We consider the dynamical behavior of Martin-Lof random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction, we prove that such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodic theorem) and are recurrent. We introduce and compare some notions of complexity for orbits in dynamical systems and prove: (i) that the complexity of the orbits of random points equals the Kolmogorov-Sinai entropy of the system, (ii) that the supremum of the complexity of orbits equals the topological entropy.

References

[1]

Benci, V., Bonanno, C., Galatolo, S., Menconi, G. and Virgilio, M., Dynamical systems and computable information. Disc. Cont. Dyn. Syst. B. v4. 935-960.

[2]

Brattka, Vasco, Hertling, Peter and Weihrauch, Klaus, A Tutorial on Computable Analysis. In: Changing Conceptions of What is Computable, Springer-Verlag, Orlando, FL, USA. pp. 425-492.

[3]

Billingsley, Patrick, Ergodic Theory and Information. 1965. John Wiley, New York.

[4]

Billingsley, Patrick, Convergence of Probability Measures. 1968. John Wiley, New York.

[5]

Volker Bosserhoff, Notions of probabilistic computability on represented spaces, in: R. Dillhage et al. (Eds.), CCA 2007, Informatik Berichte 338, Fernuniversitaet Hagen, 2008, pp. 45--78.

[6]

Bosserhoff, Volker, Notions of probabilistic computability on represented spaces. J. UCS. v14 i6. 965-995.

[7]

Brudno, A.A., Entropy and the complexity of the trajectories of a dynamical system. Trans. Moscow Math. Soc. v2. 127-151.

[8]

Jin-Yi Cai, Juris Hartmanis, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line, in: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, Academic Press, Inc., Orlando, FL, USA, pp. 605--619.

Digital Library

[9]

Peter Gács, Lecture notes on descriptional complexity and randomness. Available from: <http://www.cs.bu.edu/faculty/gacs/papers/ait-notes.pdf/>.

[10]

Gács, Peter, Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. v341. 91-137.

Digital Library

[11]

Galatolo, Stefano, Orbit complexity by computable structures. Nonlinearity. v13. 1531-1546.

[12]

Stefano Galatolo, Mathieu Hoyrup, and Cristóbal Rojas, Dynamics and abstract computability: computing invariant measures, 2009. arXiv:0903.2385.

[13]

Galatolo, Stefano, Hoyrup, Mathieu and Rojas, Cristóbal, A constructive Borel-Cantelli lemma, Constructing orbits with required statistical properties. Theor. Comput. Sci. v410 i21--23. 2207-2222.

Digital Library

[14]

Hasselblatt, Boris and Katok, Anatole, Introduction to the modern theory of dynamical systems. 1995. Encyclopedia of Mathematics and its Applications, 1995.Cambridge University Press.

[15]

Boris Hasselblatt, Anatole Katok, Handbook of Dynamical Systems, vol. 1A, Chapter Principle Structures, Elsevier, 2002.

[16]

Mathieu Hoyrup, Cristóbal Rojas, Applications of effective probability theory to Martin-Löf randomness, in: Proceedings of ICALP, 2009.

Digital Library

[17]

Mathieu Hoyrup, Cristóbal Rojas, Computability of probability measures and Martin-Löf randomness over metric spaces, Inform. Comput. 207 (7) (2009) 830--847. arXiv:0709.0907.

Digital Library

[18]

Hertling, Peter and Weihrauch, Klaus, Random elements in effective topological spaces with measure. Inform. Comput. v181 i1. 32-56.

Digital Library

[19]

Robert Kenny, Orbit Complexity and Computable Markov Partitions, Ph.D. Thesis, University of Western Australia, 2008.

[20]

Lutz, Jack H., The dimensions of individual strings and sequences. Inform. Comput. v187 i1. 49-79.

Digital Library

[21]

Li, Ming and Vitanyi, Paul M.B., An Introduction to Kolmogorov Complexity and its Applications. 1993. Springer-Verlag, Berlin.

Digital Library

[22]

Mayordomo, Elvira, A Kolmogorov complexity characterization of constructive Hausdorff dimension. Electron. Coll. Comput. Complexity (ECCC). v8 i059.

[23]

Masahiro Nakamura, Ergodic theorems for algorithmically random sequences, in: Proceedings of the Symposium on Information Theory and its Applications, 2005.

[24]

Nandakumar, Satyadev, An effective ergodic theorem and some applications. In: STOC'08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, USA. pp. 39-44.

Digital Library

[25]

Pesin, Yakov B., . 1998. Chicago Lectures in Mathematics, 1998.The University of Chicago Press.

[26]

Petersen, Karl, Ergodic Theory. 1983. Cambridge University Press.

[27]

Jan Reimann, Computability and Fractal Dimension, Ph.D. thesis, Ruprecht-Karls Universitt, Heidelberg, 2004.

[28]

Hartley Jr. Rogers, Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge, MA, USA, 1987.

Digital Library

[29]

Staiger, Ludwig, Constructive dimension equals Kolmogorov complexity. Inform. Process. Lett. v93 i3. 149-153.

[30]

V'yugin, Vladimir V., Effective convergence in probability and an ergodic theorem for individual random sequences. SIAM Theory Prob. Appl. v42 i1. 39-50.

[31]

V'yugin, Vladimir V., Ergodic theorems for individual random sequences. Theor. Comput. Sci. v207 i4. 343-361.

Digital Library

[32]

Walters, Peter, An introduction to ergodic theory. 1982. Graduate Texts in Mathematics, 1982.Springer-Verlag, New York.

[33]

Weihrauch, Klaus, Computability on computable metric spaces. Theor. Comput. Sci. v113 i2. 191-210.

Digital Library

[34]

Weihrauch, Klaus, Computable Analysis. 2000. Springer, Berlin.

Digital Library

[35]

White, Homer S., Algorithmic complexity of points in dynamical systems. Ergodic Theory Dyn. Syst. v13. 807-830.

[36]

Young, Lai-Sang, What are srb measures, and which dynamical systems have them?. J. Stat. Phys. v108. 733-754.

Cited By

Goubault-Larrecq JJia XThéron C(2023)A Domain-theoretic Approach to Statistical Programming LanguagesJournal of the ACM10.1145/361166070:5(1-63)Online publication date: 11-Oct-2023
https://dl.acm.org/doi/10.1145/3611660
Zhukova NBaimuratov IThan NMustafin N(2019)The Information Estimation System for Data Processing ResultsProceedings of the 24th Conference of Open Innovations Association FRUCT10.5555/3338290.3338407(810-814)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.5555/3338290.3338407
Ackerman NFreer CRoy D(2019)On the Computability of Conditional ProbabilityJournal of the ACM10.1145/332169966:3(1-40)Online publication date: 14-Jun-2019
https://dl.acm.org/doi/10.1145/3321699
Show More Cited By

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
1. Theory of computation
  1. Models of computation

Recommendations

Computability of probability measures and Martin-Löf randomness over metric spaces

In this paper, we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any ...
The entropy of semi-independent hyper MV-algebra dynamical systems

In this paper, the notion of a semi-independent dynamical system on a hyper MV-algebra is introduced. The concept of the entropy for a semi-independent hyper MV-algebra dynamical system is developed, and its characteristics are considered. The notion of ...
Improving the Complexity of the Lorenz Dynamics

A new four-dimensional, hyperchaotic dynamic system, based on Lorenz dynamics, is presented. Besides, the most representative dynamics which may be found in this new system are located in the phase space and are analyzed here. The new system is ...

Comments

Information & Contributors

Information

Published In

Copyright © Elsevier Inc. © 2009.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 January 2010

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Goubault-Larrecq JJia XThéron C(2023)A Domain-theoretic Approach to Statistical Programming LanguagesJournal of the ACM10.1145/361166070:5(1-63)Online publication date: 11-Oct-2023
https://dl.acm.org/doi/10.1145/3611660
Zhukova NBaimuratov IThan NMustafin N(2019)The Information Estimation System for Data Processing ResultsProceedings of the 24th Conference of Open Innovations Association FRUCT10.5555/3338290.3338407(810-814)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.5555/3338290.3338407
Ackerman NFreer CRoy D(2019)On the Computability of Conditional ProbabilityJournal of the ACM10.1145/332169966:3(1-40)Online publication date: 14-Jun-2019
https://dl.acm.org/doi/10.1145/3321699
Moriakov N(2018)On Effective Birkhoff's Ergodic Theorem for Computable Actions of Amenable GroupsTheory of Computing Systems10.1007/s00224-017-9822-562:5(1269-1287)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00224-017-9822-5
Calude CLongo G(2016)Classical, quantum and biological randomness as relative unpredictabilityNatural Computing: an international journal10.1007/s11047-015-9533-215:2(263-278)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s11047-015-9533-2
V'yugin V(2016)On Stability of Probability Laws with Respect to Small Violations of Algorithmic RandomnessTheory of Computing Systems10.1007/s00224-015-9632-658:3(403-423)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00224-015-9632-6
Huang DMorrisett G(2016)An Application of Computable Distributions to the Semantics of Probabilistic Programming LanguagesProceedings of the 25th European Symposium on Programming Languages and Systems - Volume 963210.1007/978-3-662-49498-1_14(337-363)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49498-1_14

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents