On the Persistency of Gellular Automata, Andrew Adamatzky (eds) Reversibility and Universality

On the Persistency of Gellular Automata, Andrew Adamatzky (eds) Reversibility and Universality
复制标题

关于凝胶自动机的持久性,Andrew Adamatzky(编辑)可逆性和普遍性

DOI:
10.1007/978-3-319-73216-9_18
复制
发表时间:
2018
期刊:
Emergence, Complexity and Computation
影响因子:
--
通讯作者:
Masami Hagiya and Katsunobu Imai
Masami Hagiya and Katsunobu Imai
中科院分区:
--
文献类型:
--
作者:
青嶋 誠;矢田 和善;横山侑政・瀧川一学;Masami Hagiya and Katsunobu Imai

文献摘要

相似文献

细胞自动机作为一种新的细胞自动机模型被提出,旨在用凝胶材料来实现。研究了计算的普适性,并用通过Moritas旋转元件的单向信号传播证明了计算的普适性。文中还提出了一种实现MarGolus邻域的方法,使块元胞自动机可以直接在模型中实现。在这一章中,通过数值模拟检验了这些结果的持久性。结果表明,块元胞自动机可以经历无限次的状态转换,单向信号可以在电路上重复传输。为了显示持久性,需要对建议的反应进行轻微修改。
Gellular automata have been proposed as a new model of cellular automata that are intended to be implemented with gel materials. Computational universality has been investigated and has been shown with unidirectional signal propagation through Moritas rotary elements. A way to realize a Margolus neighborhood has also been proposed, so that block cellular automata can be realized directly in the model. In this chapter, the persistency of those results is examined with numerical simulations. It is shown that block cellular automata can undergo an infinite number of state transitions, and unidirectional signals can be transmitted repeatedly over a circuit. To show persistency, slight modifications of the proposed reactions are needed.