作者: Sergey Verlan
DOI: 10.1007/978-3-319-20028-6_10
关键词: Cellular automaton 、 Register machine 、 Turing machine 、 Pure mathematics 、 Theoretical computer science 、 Cellular computing 、 Universality (dynamical systems) 、 Boolean network 、 Mathematics
摘要: In this article we present an overview of the study universality problem in area molecular and cellular computing. We consider results that deal explicitly with aim to optimize obtained construction. A particular attention is given models based on splicing operation as well multiset-rewriting models.