Visualization of the Computation Process of a Universal Register Machine
Shigeru Ninagawa, Genaro J. Martinez

TL;DR
This paper introduces a spectral analysis method to visualize and interpret the computation process of a universal register machine emulated on the Game of Life cellular automaton, revealing activity patterns and functional regions.
Contribution
It presents a novel spectral analysis approach to visualize and distinguish different functional regions during computation in cellular automaton emulations of register machines.
Findings
Power spectrum shapes classify activity patterns
Visualization of pulse movement and register activity
Identification of functional regions in the automaton
Abstract
Universal register machine, a formal model of computation, can be emulated on the array of the Game of Life, a two-dimensional cellular automaton. We perform spectral analysis on the computation dynamical process of the universal register machine on the Game of Life. The array is divided into small sectors and the power spectrum is calculated from the evolution in each sector. The power spectrum can be classified into four categories by its shape; null, white noise, sharp peaks, and power law. By representing the shape of power spectrum by a mark, we can visualize the activity of the sector during the computation process. For example, the track of pulse moving between components of the universal register machine and the position of frequently modified registers can be identified. This method can expose the functional difference in each region of computing machine.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Evolutionary Algorithms and Applications · Computability, Logic, AI Algorithms
