On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata

Simon Wacker, Thomas Worsch · Fundamenta Informaticae · 2013

While for synchronous deterministic cellular automata there is an accepted definition of reversibility, this is not the case for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invert

Read the paper · More papers on PaperTik