Necessary Conditions for Density Classification by Cellular Automata

Capcarrere, M. and Sipper, M. (2001) Necessary Conditions for Density Classification by Cellular Automata. Physical Review E, 64 (3 (2)). ISSN 1063-651X . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1103/PhysRevE.64.036113

Abstract

Classifying the initial configuration of a binary-state cellular automaton (CA) as to whether it contains a majority of 0s or 1s-the so-called density-classification problem-has been studied over the past decade by researchers wishing to glean an understanding of how locally interacting systems compute global properties. In this paper we prove two necessary conditions that a CA must satisfy in order to classify density: (1) the density of the initial configuration must be conserved over time, and (2) the rule table must exhibit a density of 0.5.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:58
Last Modified: 20 Aug 2009 15:18
Resource URI: http://kar.kent.ac.uk/id/eprint/13561 (The current URI for this page, for reference purposes)
  • Depositors only (login required):