Evolution of Computational Structures in Uniform Cellular Automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111930" target="_blank" >RIV/00216305:26230/14:PU111930 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6900530" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6900530</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CEC.2014.6900530" target="_blank" >10.1109/CEC.2014.6900530</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Evolution of Computational Structures in Uniform Cellular Automata

Popis výsledku v původním jazyce

In this paper we present an approach for evolutionary design of computational processes in two-dimensional 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 non-trivial computations can be realized in uniform two-dimensional 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.

Název v anglickém jazyce

Evolution of Computational Structures in Uniform Cellular Automata

Popis výsledku anglicky

In this paper we present an approach for evolutionary design of computational processes in two-dimensional 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 non-trivial computations can be realized in uniform two-dimensional 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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20206 - Computer hardware and architecture

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2014 IEEE Congress on Evolutionary Computation (CEC)

ISBN

978-1-4799-1488-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

2732-2739

Název nakladatele

IEEE Computational Intelligence Society

Místo vydání

Beijing

Místo konání akce

Beijing

Datum konání akce

6. 7. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000356684604001