Abstract
We propose a model based on Elementary Cellular Automata (ECA) where each cell has its own semantics defined by a lattice. Semantics play the following two roles: (1) a state space for computation and (2) a mediator generating and negotiating the discrepancy between the rule and the state. We call semantics playing such roles ‘local semantics’. A lattice is a mathematical structure with certain limits. Weakening the limits reveals local semantics. Firstly, we implement local semantics for ECA and call the result ‘Lattice-Driven Cellular Automata’ (LDCA). In ECA rules are common and invariant for all cells, and uniquely determine the state changes, whereas in LDCA rules and states interplay with each other dynamically and directly in each cell. Secondly, we compare the space–time patterns of LDCA with those of ECA with respect to the relationship between the mean value and variance of the ‘input-entropy’. The comparison reveals that LDCA generate complex patterns more universally than ECA. Lastly, we discuss the observation that the direct interplay between levels yields wholeness dynamically.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
