World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.


    This paper describes our research on using Genetic Programming to obtain transition rules for Cellular Automata, which are one type of massively parallel computing system. Our purpose is to determine the existence of a limit of chaos for three dimensional Cellular Automata, empirically demonstrated for the two dimensional case. To do so, we must study statistical properties of 3D Cellular Automata over long simulation periods. When dealing with big three dimensional meshes, applying the transition rule to the whole structure can become a extremely slow task. In this work we decompose the Automata into pieces and use OpenMp to parallelize the process. Results show that using a decomposition procedure, and distributing the mesh between a set of processors, 3D Cellular Automata can be studied without having long execution times.


    • OpenMP Architecture Review Board. OpenMP C and C++ Application Program Interface. OpenMP Architecture Review Board, 2005 . Google Scholar
    • Nichael Lynn Cramer, A representation for the adaptive generation of simple sequential programs, Proceedings of an International Conference on Genetic Algorithms and the Applications, ed. John J. Grefenstette (Carnegie-Mellon University, Pittsburgh, PA, USA) pp. 183–187. Google Scholar
    • R. M. Friedberg, IBM J. Research and Development 2(1), 2 (1958). Crossref, ISIGoogle Scholar
    • S. Garcia and F. Gonzlez, Genetic Programming and Evolvable Machines 2(2), 111 (2001). Google Scholar
    • J. R.   Koza , Genetic Programming: On the Programming of Computers by Means of Natural Selection ( MIT Press , Cambridge, MA, USA , 1992 ) . Google Scholar
    • C. Langton. pages 1-2, 1988 . Google Scholar
    • C. G. Langton, Physica D 42, 12 (1990), DOI: 10.1016/0167-2789(90)90064-V. Crossref, ISIGoogle Scholar
    • Claude E. Shannon and Warren Weaver, The mathematical theory of communication (The University of Illinois Press, 1949) pp. 1–2. Google Scholar
    • Mosh   Sipper , Machine nature: The Coming Age of Bio-inspired Computing ( McGraw-Hill , 2002 ) . Google Scholar
    • T.   Toffoli and N.   Margolus , Cellular Automata Machines ( The MIT Press , Cambridge, Massachusetts , 1987 ) . CrossrefGoogle Scholar
    • J.   von Neumann , Theory of Self-Reproducing Automata ( University of Illinois Press , Illinois, Illinois , 1966 ) . Google Scholar
    • S. Wolfram, Physica D 10, 1 (1984), DOI: 10.1016/0167-2789(84)90245-8. Crossref, ISIGoogle Scholar
    • S. Wolfram and N. H. Packard, J. Stat. Phys. 38, 901 (1985). ISIGoogle Scholar