written by Wolfgang Christian

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.

• Download ejs_model_ContinuousCellularAutomata.jar - 2215kb Java Archive File

Last Modified October 15, 2017

This file has previous versions.

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 ejs_src_ContinuousCellularAutomata.zip - 47kb Compressed File

Last Modified October 15, 2017

This file has previous versions.