Cellular Automata
From CasGroup
(New page: '''Cellular Automata''' are regular arrays of identical finite state automata whose next state is determined solely by their current state and the state of their neighbours, usually by a ...) |
|||
| Line 1: | Line 1: | ||
'''Cellular Automata''' are regular arrays of identical finite state automata whose next state is determined solely by their | '''Cellular Automata''' are regular arrays of identical finite state automata whose next state is determined solely by their | ||
current state and the state of their neighbours, usually by a boolean transition function. They are closely related to | current state and the state of their neighbours, usually by a boolean transition function. They are closely related to | ||
| - | [[Random Boolean Network| | + | [[Random Boolean Network|Random Boolean Networks (RBN)]]. A CA contains many cells and each cell is a finite-state automaton |
connected to its neighbors - and so the whole machine or device is called a cellular automaton (pl. cellular automata). They | connected to its neighbors - and so the whole machine or device is called a cellular automaton (pl. cellular automata). They | ||
were introduced by the mathematician John von Neumann in the 1950s as simple models of biological self-reproduction, and they | were introduced by the mathematician John von Neumann in the 1950s as simple models of biological self-reproduction, and they | ||
