Skip to main content
Log in

Criterion of Infinite Topological Entropy for Multidimensional Cellular Automata

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

The paper proves the infinity of the topological entropy for a wide class of multi-dimensional cellular automata, namely, automata with spaceships.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Eppstein, D., Searching for Spaceships, MSRI Lectures, July 2000. Available from http://www.msri.org/publications/ln/msri/2000/gametheory/eppstein/1/.

  2. D'amico, M., Manzini, G., and Margara, L., On Computing the Entropy of Cellular Automata, Theor. Comp. Sci., 2003, vol. 290, pp. 1629–1646.

    Google Scholar 

  3. Katok, A.B. and Hasselblatt, B., Introduction to the Modern Theory of Dynamical Systems, Encyclopedia of Mathematics and Its Applications, vol. 54, Cambridge: Cambridge Univ. Press, 1995. Translated under the title Vvedenie v sovremennuyu teoriyu dinamicheskikh sistem, Moscow: Faktorial, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lakshtanov, E.L., Langvagen, E.S. Criterion of Infinite Topological Entropy for Multidimensional Cellular Automata. Problems of Information Transmission 40, 165–167 (2004). https://doi.org/10.1023/B:PRIT.0000043929.26267.14

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:PRIT.0000043929.26267.14

Keywords

Navigation