Skip to main content

A Simple Cellular Automation that Solves the Density and Ordering Problems

Sipper, Moshe, Capcarrere, Mathieu S., Ronald, Edmund M. A. (1998) A Simple Cellular Automation that Solves the Density and Ordering Problems. International Journal of Modern Physics C, 9 (7). pp. 899-902. (doi:10.1142/S0129183198000868) (KAR id:21594)

PDF
Language: English
Download (147kB) Preview
[thumbnail of A_Simple_Cellular_Automation_that_Solves_the_Density_and_Ordering_Problems.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL
http://dx.doi.org/10.1142/S0129183198000868

Abstract

Cellular automata (CA) are discrete, dynamical systems that perform computations

of a CA may give rise to emergent computation, referring to the appearance of

system's elementary components nor in their local interconnections.1 As such, CAs

powerful paradigm for attaining ?ne-grained, massively parallel computation.

global density of bits in an initial state con?guration. This problem, known as

this short communication we describe two previous versions of the problem along with their CA solutions, and then go on to show that there exists yet a third version

| which admits a simple solution.

Item Type: Article
DOI/Identification number: 10.1142/S0129183198000868
Uncontrolled keywords: Cellular Automata; Density Problem; Emergent Computation
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Aug 2009 16:33 UTC
Last Modified: 16 Feb 2021 12:32 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21594 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year