Crystalline Computation
Norman Margolus
Abstract
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional attributes that are basic to physics: systems which are exactly invertible at their finest scale, which obey exact conservation laws, which support the evolution of arbitrary complexity, etc. In this paper, we discuss techniques for bringing CA models closer to physics, and some of the interesting consequences of doing so.
Create a lesson
Related papers
A new discrete velocity method for Navier-Stokes equations
Michael Junk, S. V. Raghurama Rao
Construction of Molecular Dynamics Like Cellular Automata Models for Simulation of Compressible Fluid Dynamic Systems
Himanshu Agrawal
Lattice Gases and Cellular Automata
Bruce M. Boghosian
Cellular Automaton Rule184++C. A Simple Model for the Complex Dynamics of Various Particles Flow
A. Awazu
Exact results for deterministic cellular automata traffic models
Henryk Fuks
Cellular Automaton Model for Immunology of Tumor Growth
Margarita Voitikova