Work

Phase Space Invertible Asynchronous Cellular Automata

Year: 2012

Type: article

Abstract: While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating it, and that it is decidable whether an asynchronous cellular automaton has this property or not, even in higher dimensions.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.90.19

Authors: Simon Wacker, Thomas Worsch

Institution: Karlsruhe Institute of Technology

Language: English

Topic: Cellular Automata and Applications

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2086474312

FWCI: 0.338

Cites: 8

Cited by: 1

Related to: 10