Phase Space Invertible Asynchronous Cellular Automata

被引：2
|
作者：
Wacker, Simon [1 ]
Worsch, Thomas [1 ]
机构：
[1] Karlsruhe Inst Technol, Dept Informat, Karlsruhe, Germany
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2012年 / 90期
关键词：
D O I：
10.4204/EPTCS.90.19
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：236 / 254
页数：19
相关论文
共 50 条
12345