Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA
Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA
复制标题
通用极权异步元胞自动机及其DNA的可能实现
DOI:
10.1007/978-3-319-41312-9_15
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
M. Hagiya
中科院分区:
文献类型:
--
作者:
T. Isokawa;F. Peper;I. Kawamata;N. Matsui;S. Murata;M. Hagiya
This paper presents a Cellular Automaton (CA) model designed for possible implementation by the reaction and diffusion of DNA strands. The proposed CA works asynchronously, whereby each cell undergoes its transitions independently from other cells and at random times. The state of a cell changes in a cyclic manner, rather than according to an any-to-any mapping. The transition rules are designed as totalistic, i.e., the next state of a cell is determined only by the number of states in the neighborhood of the cell, not by their relative positions. Universal circuit elements are designed for the CA as well as wires and crossings to connect them, which implies that the CA is Turing-complete.
影响因子:
9.9
作者:
通讯作者:
--