« Dynamic Graph Coloring using CCM -- A Model for Emergent Computation | Main | Methods of Controling Locality in Problem Solving using CCM: A Model for Emergent Computation »

The Effects of Randomness in Asynchronous 1D Cellular Automata

Kanada, Y., Artificial Life IV, Poster, 1994.

[ 日本語のページ ]
[ Paper PDF file ] [ Poster in hypertext format (not yet available) ]
[ Unpublished extended paper PDF file ]

Abstract: Cellular automata are used as models of emergent computation and artificial life. They are usually simulated under synchronous and deterministic conditions. Thus, they are evolved without existence of noise, i.e., fluctuation or randomness. However, noise is unavoidable in real world. The objective of the present paper is to show the following two effects and several other effects caused by asynchronism or synchronism and by existence or nonexistence of randomness in the computation order in one-dimensional asynchronous cellular automata (1D-ACA) experimentally. One major effect is that certain properties of two-neighbor 1D-ACA are fully expressed in their patterns if certain level of randomness exists, though they are only partially expressed if no randomness exists. The patterns generated by 1D-ACA may have characteristics, such as mortality of domains of 1's or splitting domains of 0Us into two. These characteristics, which are coded in the RchromosomeS of the automata, i.e., the look-up table, are fully expressed only when the computation order is random. The other major effect is that phantom phenomena, which almost never occurs in real world, sometimes occur when there is no noise. The characteristics of patterns generated by several 1D-ACA are drastically changed from uniform patterns to patterns with multiple or chaotic phases when only low level of noise is added.

Reference: "Asynchronous cellular automaton", Wiki Pedia. The originality of this paper is briefly described.

Introduction to this research theme: RACA: Randomized Asynchronous Cellular Automata

Keywords: Randomized cellular automaton, Asynchronous cellular automaton, Randomized cellular automata, Asynchronous cellular automata, Randomized computation, Rule-based computation

Post a comment


This page contains a single entry from the blog posted on July 1, 1994 12:00 AM.

Many more can be found on the main index page or by looking through the archives.

(C) Copyright 2007 by Yasusi Kanada
Powered by
Movable Type 3.36