Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-hgkh8 Total loading time: 0 Render date: 2024-03-29T10:56:03.432Z Has data issue: false hasContentIssue false

2 - On the Number of ON Cells in Cellular Automata

Published online by Cambridge University Press:  25 May 2018

N. J. A. Sloane
Affiliation:
The OEIS Foundation Inc., 11 South Adelaide Ave., Highland Park, NJ 08904, USA
Steve Butler
Affiliation:
Iowa State University
Joshua Cooper
Affiliation:
University of South Carolina
Glenn Hurlbert
Affiliation:
Virginia Commonwealth University
Get access

Summary

Abstract

If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain “odd-rule” CAs, including Rule 150, Rule 614, and Fredkin's Replicator, the answer can be found by using the combination of a new transformation of sequences, the run length transform, and some delicate scissor cuts. Several other CAs are also discussed, although the analysis becomes more difficult as the patterns become more intricate.

Introduction

When confronted with a number sequence, the first thing is to try to conjecture a rule or formula, and then (the hard part) prove that the formula is correct. This chapter had its origin in the study of one such sequence, 1, 8, 8, 24, 8, 64, 24, 112, 8, 64, 64, 192, (A1602391), although several similar sequences will also be discussed.

These sequences arise from studying how activity spreads in cellular automata (for background see [2, 5, 8, 11, 14, 17, 20, 21, 23, 24, 26]). If we start with a single ON cell, how many cells will be ON after n generations? The preceding sequence arises from the CA known as Fredkin's Replicator [13]. In 2014, Hrothgar sent the author a manuscript [10] studying this CA, and conjectured that the sequence satisfied a certain recurrence. One of the goals of the present chapter is to prove that this conjecture is correct; see (2.31).

In §2.2 we discuss a general class (the “odd-rule” CAs) to which Fredkin's Replicator belongs, and in §2.3 we introduce an operation on number sequences (the “run length transform”) that helps in understanding the resulting sequences. Fredkin's Replicator, which is based on the Moore neighborhood, is the subject of §2.4, and §2.5 analyzes another odd-rule CA, based on the von Neumann neighborhood with a center cell. Although these two CAs are similar, different techniques are required for establishing the recurrences. Both proofs involve making scissor cuts to dissect the configuration of ON cells into recognizable pieces.

Type
Chapter
Information
Connections in Discrete Mathematics
A Celebration of the Work of Ron Graham
, pp. 13 - 38
Publisher: Cambridge University Press
Print publication year: 2018

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. P. C., Allaart and K., Kawamura. The Takagi function: A survey. Real Analysis Exchange, 37 (2011/12), 1–54; http://arxiv.org/abs/1110.1691.
2. D., Applegate, O. E., Pol, and N. J. A., Sloane. The toothpick sequence and other sequences from cellular automata. Congress. Numerant. 206 (2010), 157–191; http://arxiv.org/abs/1004.3036.Google Scholar
3. S. B., Ekhad, N. J. A., Sloane, and D., Zeilberger. A meta-algorithm for creating fast algorithms for counting ON cells in odd-rule cellular automata, 2015. http://arxiv.org/abs/1503.01796.
4. S. B., Ekhad, N. J. A., Sloane, and D., Zeilberger. “Odd-rule” cellular automata on the square grid, 2015. http://arxiv.org/abs/1503.04249.
5. D., Eppstein. Growth and decay in life-like cellular automata, 2009. http://arxiv.org/ abs/0911.2890.
6. S., Finch, P., Sebah, and Z.-Q., Bai. Odd entries in Pascal's trinomial triangle, 2008. http://arxiv.org/abs/0802.2654.
7. E., Fredkin. Digital mechanics, an informational process based on reversible universal cellular automata. In Cellular Automata, Theory and Experiment, ed. H., Gutowitz. MIT Press, Cambridge, MA, 1990, pp. 254–270.Google Scholar
8. E., Fredkin. Digital Mechanics (Working Draft), 2000. http://64.78.31.152/ wp-content/uploads/2012/08/digital_mechanics_book.pdf.
9. H., Havermann, H., Havermann, B., Cloitre, R., Stephan, et al. Entry A071053 in [16], 2002–2015.
10. Hrothgar. Notes on a replicating automaton. Unpublished manuscript, July 2014.
11. J., Kari. Theory of cellular automata: A survey. Theoret. Comput. Sci. 334 (2005), 3–33.Google Scholar
12. J. C., Lagarias. The Takagi function and its properties. In Functions in Number Theory and Their Probabilistic Aspects, ed. K., Matsumoto, W., Layman, Hrothgar, O. E. Pol, et al. RIMS Lecture Notes, Vol. B34, Res. Inst. Math. Sci., Kyoto, 2012, pp. 153–189. http://arxiv.org/abs/1112.4205.Google Scholar
13. J. Layman, Hrothgar, O. E., Pol, et al. Entry A160239 in [16], 2009–2015.
14. O., Martin, A. M., Odlyzko, and S., Wolfram. Algebraic properties of cellular automata. Commun. Math. Phys. 93 (1984), 219–258.Google Scholar
15. S., Mitra and S., Kumar. Fractal replication in time-manipulated one-dimensional cellular automata. Complex Systems 16 (2006), 191–207.Google Scholar
16. The OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, 1996–present. https://oeis.org.
17. N. H., Packard and S., Wolfram. Two-dimensional cellular automata. J. Statist. Phys. 38 (1985), 901–946.Google Scholar
18. B., Salvy and P., Zimmermann. GFUN: A Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Software, 20 (1994), 163–177.Google Scholar
19. T., Sillke and H., Postl. Odd trinomials: t (n) = (1 + x + x2)n, 2004. www.mathematik.uni-bielefeld.de/∼sillke/PUZZLES/trinomials.
20. D., Singmaster. On the cellular automaton of Ulam and Warburton. M500 Magazine of the Open University, No. 195 (December 2003), 2–7; https://oeis.org/A079314/ a079314.pdf.Google Scholar
21. S. M., Ulam. On some mathematical problems connected with patterns of growth of figures. In Mathematical Problems in the Biological Sciences, ed. R. E., Bellman, Proc. Sympos. Applied Math., Vol. 14, Amer. Math. Soc., 1962, 215–224.Google Scholar
22. E. W., Weisstein. MathWorld, Entries for Rules 30, 90, 110, 150, 182, etc. http:// mathworld.wolfram.com/, 2004–present.
23. S., Wolfram. Statistical mechanics of cellular automata. Rev. Mod. Phys. 55 (1983), 601–644.Google Scholar
24. S., Wolfram. Universality and complexity in cellular automata (Cellular Automata, Los Alamos, 1983). Physica D 10 (1984), 1–35.Google Scholar
25. S., Wolfram. The Mathematica Book. Cambridge University Press and Wolfram Research, Inc., New York 2000.Google Scholar
26. S., Wolfram. A New Kind of Science. Wolfram Media, Champaign, IL, 2002.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×