A new universal cellular automaton discovered by evolutionary algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3102, Issue , 2004, Pages 175-187

  Sapin, Emmanuel ^a   Bailleux, Olivier ^a   Chabrier, Jean Jacques ^a   Collet, Pierre ^b  

^a UNIVERSITÉ DE BOURGOGNE   (France)

^b UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR AUTOMATA; COMPUTATION THEORY; COMPUTER CIRCUITS;

ANALYTICAL DESCRIPTION; COMPUTATIONAL UNIVERSALITY; GAME OF LIFE; REPLICABILITY; UNDECIDABILITY;

EVOLUTIONARY ALGORITHMS;

EID: 33750014649     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_16     Document Type: Article

References (19)

1. S. WOLFRAM. Universality and complexity in cellular automata. In Physica D, 10:1-35, 1984.
2. M. GARDNER. The fantastic combinaisons of john conway's new solitaire game "life". In Scientific American, 1970.
3. M. GARDNER. On cellular automata, self-reproduction, the garden of eden, and the game of life. In Scientific American, 224:112-118, 1971.
4. C. DYTHAM and B. SHORROCKS. Selection, patches and genetic variation: A cellular automata modeling drosophila populations. Evolutionary Ecology, 6:342-351, 1992.
5. I. R. EPSTEIN. Spiral waves in chemistry and biology. In Science, 252, 1991.
6. ERMENTROUT, G. LOTTI, and L. MARGARA . Cellular automata approaches to biological modeling. In Journal of Theoretical Biology, 60:97-133, 1993.
7. S. WOLFRAM N.H. PACKARD. Two-dimensional cellular automata. In Journal of Statistical Physics, 38:901-946, 1985.
8. E. BERLEKAMP, J.H CONWAY, and R.Guy. Winning ways for your mathematical plays. Academic press, New York, 1982.
9. P. RENDELL. Turing universaility of the game of life. Andrew Adamatzky (ed.), Collision-Based Computing, Springer Verlag., 2002.
10. S. WOLFRAM. Twenty problems in the theory of cellular automata. In Physica Scripta, pages 170-183, 1985.
11. N. MARGOLUS. Physics-like models of computation. In Physica D, 10:81-95, 1984.
12. K. LINDGREN and M. NORDAHL. Universal computation in simple one dimensional cellular automata. In Complex Systems, 4:299-318, 1990.
13. K. MORITA Y. TOJIMA I. KATSUNOBO T. OGIRO. Universal computing in reversible and number-conserving two-dimensional cellular spaces. Andrew Adamatzky (ed.), Collision-Based Computing, Springer Verlag., 2002.
14. A. ADAMATZKY. Universal dymical computation in multi-dimensional excitable lattices. In International Journal of Theoretical Physics, 37:3069-3108, 1998.
15. E. R. BANKS. Information and transmission in cellular automata. PhD thesis, MIT, 1971.
16. C. BAYS. Candidates for the game of life in three dimensions. In Complex Systems, 1:373-400, 1987.
17. E. SAPIN, O. BAILLEUX, and J.J. CHABRIER. Research of complex forms in the cellular automata by evolutionary algorithms, in EA03.Lecture Notes in Computer Science, 2936:373-400, 2004.
18. E. SAPIN, O. BAILLEUX, and J.J. CHABRIER. Research of a cellular automaton simulating logic gates by evolutionary algorithms. In EuroGP03.Lecture Notes in Computer Science, 2610:414-423, 2003.
19. A. DEWDNEY. The planiverse. Poseidon Press, 1984.