Treffer: Research of complex forms in cellular automata by evolutionary algorithms
Title:
Research of complex forms in cellular automata by evolutionary algorithms
Source:
Artificial evolution (Marseille, 27-30 October 2003, revised selected papers)Lecture notes in computer science. :357-367
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Algorithme génétique, Genetic algorithm, Algoritmo genético, Algorithme évolutionniste, Evolutionary algorithm, Algoritmo evoluciónista, Automate cellulaire, Cellular automaton, Autómata celular, Circuit ET, AND circuit, Circuito Y, Porte logique, Logic gate, Puerta lógica, Algorithme cellulaire, Cellular algorithm, Algoritmo celular
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Université de Bourgogne, 9 avenue A. Savary, B.P. 47870, 21078 Dijon, France
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15851297
Database:
PASCAL Archive
Weitere Informationen
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.