Spectral representations and global maps of cellular automata dynamics

We present a spectral representation of any computation performed by a Cellular Automaton (CA) of arbitrary topology and dimensionality via an appropriate coding scheme in Fourier space that can be implemented in an analog machine ideally circumventing part of the overall waste heat production. We explore further consequences of this encoding and we provide a simple example based on the “Game-of-Life” where we find global maps for small lattices indicating an interesting underlying recursive structure.