BIDLO Michal. Evolution of Computational Structures in Uniform Cellular Automata. In: 2014 IEEE Congress on Evolutionary Computation (CEC). Beijing: IEEE Computational Intelligence Society, 2014, pp. 27322739. ISBN 9781479914883. Available from: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6900530 
Publication language:  english 

Original title:  Evolving multiplication as emergent behavior in cellular automata using conditionally matching rules 

Title (cs):  Evoluční návrh výpočetních struktur v uniformních celulárních automatech 

Pages:  27322739 

Proceedings:  2014 IEEE Congress on Evolutionary Computation (CEC) 

Conference:  IEEE Congress on Evolutionary Computation 2014 

Place:  Beijing, CN 

Year:  2014 

URL:  http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6900530 

ISBN:  9781479914883 

DOI:  10.1109/CEC.2014.6900530 

Publisher:  IEEE Computational Intelligence Society 

Files:  


Keywords 

Genetic algorithm, cellular automaton, transition function, conditionally matching rule, multiplication, emergent behavior.

Annotation 

In this paper we present an approach for evolutionary design of computational processes in twodimensional uniform binary cellular automata. A special representation technique called conditionally matching rules will be utilized to encode the transition functions of the cellular automata. The principle of the computational process in a cellular automaton is to interpret some cells as input bits some (possibly other) cells as output bits (i.e. the result) of the computation. The goal is to find using genetic algorithm a suitable transition function according to which a specific computation could be observed during the development of the cellular atuomation for all the possible binary combinations stored in the input cells. Both the input values and the result is represented by the state values of the cells. The input of the computation will be represented by the initial state of the cellular automaton. After a finite number of development steps the cells representing the output bits are expexted to contain the result of computation. It will be shown that nontrivial computations can be realized in uniform twodimensional cellular array. In the experiments presented in this paper some different setups of conditionally matching rules and arrangement of the input and output cells will be investigated.

BibTeX: 

@INPROCEEDINGS{
author = {Michal Bidlo},
title = {Evolving multiplication as emergent behavior in cellular
automata using conditionally matching rules},
pages = {27322739},
booktitle = {2014 IEEE Congress on Evolutionary Computation (CEC)},
year = {2014},
location = {Beijing, CN},
publisher = {IEEE Computational Intelligence Society},
ISBN = {9781479914883},
doi = {10.1109/CEC.2014.6900530},
language = {english},
url = {http://www.fit.vutbr.cz/research/view_pub.php?id=10517}
} 