The Continuous Cellular Automata Model creates a one-dimensional array of rational numbers Xi and applies a rule that determines how each cell evolves from one generation to the next. The numerators and denominators of numbers Xi are stored as arbitrary precision Big Integer objects so all computations are exact. Because arbitrary precision arithmetic is computationally intensive, we use the Parallel Java library to implement the model.
The Continuous Cellular Automata Model was developed by Wolfgang Christian using the Easy Java Simulations (Ejs) modeling tool. It is based on the One-Dimensional Continuous Cellular Automata model in Chapter 17 of the book "Building Parallel Programs" by Alan Kaminsky.
Please note that this resource requires
at least version 1.6 of
Continuous Cellular Automata Source Code
The source code zip archive contains an EJS-XML representation of the Continuous Cellular Automata Model. Unzip this archive in your EJS workspace to compile and run this model using EJS. download 49kb .zip
Last Modified: April 3, 2012
Christian, W. (2012). Continuous Cellular Automata Model (Version 1.0) [Computer software]. Retrieved September 29, 2016, from http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11771&DocID=2632
%0 Computer Program %A Christian, Wolfgang %D April 3, 2012 %T Continuous Cellular Automata Model %7 1.0 %8 April 3, 2012 %U http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11771&DocID=2632
Disclaimer: ComPADRE offers citation styles as a guide only. We cannot offer interpretations about citations as this is an automated procedure. Please refer to the style manuals in the Citation Source Information area for clarifications.