A study of Inverse Ultra-discretization of cellular automata
Abstract: In this article, I propose a systematic method for the inverse ultra-discretization of cell automata using a functionally complete operation. We derive difference equations for the 256 kinds of elementary cellular automata(ECA) introduced Wolfram\cite{wolfram} by the proposed means of the inverse ultra-discretization. We show that the behaviors of ECAs can be completely reproduced by numerically solving the obtained difference equations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.