CDM/SLANG

CDM/SLANG

Access

Software
      current version:   (Jul.~15, 1993)
      public distribution:   yes
           what is available:   source and executable
           and where:   ftp://ftp.essex.ac.uk/pub/robots/ArtificialLife/public/cdm/
           mirror sites:   ---
Author/Maintainer
      name:   Hans Sieburg
      WWW home page:   ---
      email:   mailto:hsieburg@ucsd.edu
General information about the software
      WWW information:   ---
      Literature:   Sieburg:1991:CDM

Hardware and software requirements

Environment 1
      simulation runs on:   Apple MacIntosh (?) (at least the distribution is produced using Stuffit and BinHex)

Standard CA

Lattice
      lattice structure:   two-dim.~Euclidean grids
      lattice size:   arbitrary rectangles
      boundary conditions:   not known
Neighborhoods
      limitations:   (subsets of) Moore neighborhood with radius 1
      notation:   symbolic names
      grouping constructs:   no
Set of states
      max size:   not known
      structure:   not known
Local rule
      limitations:   
Further remarks:    Strictly speaking CA with synchronous updating of all cells are not possible with CDM; in each global step one cell is chosen randomly and updated $p\cdot N$ times, where $N$ is the total number of cells and $p$ can be specified.

Extensions

Local rule
      probabilistic rules:   not known
      block rules:   no
      moving objects:   no
Global rule
      asynchronous CA:   no (see the remarks at the end)
Temporal inhomogeneity:    no
Spatial inhomogeneity:    no
Hierarchical aspects:    no

BibTeX entries

All entries in one file, comprising   Sieburg:1991:CDM

Further remarks

Sieburg:1991:CDM are speaking about asynchronous CA, but it seems that what they mean are probabilistic CA. Besides that, it is unfortunately not easy understand the paper. If we said ``not known'' above, it really means ``I couldn't deduce from the paper''.\par You may also want to have a look at http://www.insilico.com/. This is Sieburg's company; they are selling a newer version of CDM and are giving away for free binaries of a ``light'' variant of it (which runs on several architectures.
This page has been automatically generated on Sat May 3 14:15:05 1997
Please send questions, remarks, updates to Thomas Worsch <worsch@ira.uka.de>