The computational capability of chemical reaction automata

Fumiya Okubo, Takashi Yokomori

研究成果: Article

3 引用 (Scopus)

抜粋

We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant of reaction automata (RAs) studied in recent literature ([7–9]).

We show that CRAs in maximally parallel manner are computationally equivalent to Turing machines, while the computational power of CRAs in sequential manner coincides with that of the class of Petri nets, which is in marked contrast to the result that RAs (in both maximally parallel and sequential manners) have the computing power of Turing universality ([7, 8]). Intuitively, CRAs are defined as RAs without inhibitor functioning in each reaction, providing an offline model of computing by chemical reaction networks (CRNs).

Thus, the main results in this paper not only strengthen the previous result on Turing computability of RAs but also clarify the computing powers of inhibitors in RA computation.

元の言語English
ページ(範囲)53-66
ページ数14
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8727
出版物ステータスPublished - 2014 1 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント The computational capability of chemical reaction automata' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用