Surjunctivity and reversibility of cellular automata over concrete categories
Tullio Ceccherini-Silberstein, Michel Coornaert
TL;DR
This paper explores the properties of surjunctivity and reversibility in cellular automata within specific concrete categories, extending theoretical understanding inspired by Misha Gromov's ideas.
Contribution
It introduces a framework for analyzing cellular automata over concrete categories, highlighting new conditions for surjunctivity and reversibility.
Findings
Identifies conditions under which cellular automata are surjunctive.
Establishes criteria for reversibility in cellular automata over concrete categories.
Extends Gromov's ideas to new categorical contexts.
Abstract
Following ideas developed by Misha Gromov, we investigate surjunctivity and reversibility properties of cellular automata defined over certain concrete categories.
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 · Computability, Logic, AI Algorithms · semigroups and automata theory