Crystalline Computation
comp-gas
2007-05-23 v1 Cellular Automata and Lattice Gases
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.
Cite
@article{arxiv.comp-gas/9811002,
title = {Crystalline Computation},
author = {Norman Margolus},
journal= {arXiv preprint arXiv:comp-gas/9811002},
year = {2007}
}
Comments
39 pages, 15 figures (48 images), to appear in the book Feynman and Computation, A. Hey ed., (c) Perseus Books (1998)