作者: Hendrik Jan Hoogeboom
关键词: Automaton 、 Turing machine 、 Default rule 、 Parallel computing 、 Computer science 、 Parallelism (grammar) 、 Power (physics)
摘要: P systems with carriers are shown to be computationally complete only a single membrane and two carriers. We argue that their power is due the maximal parallelism required in application of rules. In fact, carrier, these equivalent blind counter automata. Finally, passenger restriction again complete.