### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 53-66 |

Number of pages | 14 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 8727 |

Publication status | Published - 2014 |

### Fingerprint

### Keywords

- Chemical reaction automata
- Chemical reaction networks
- Reaction automata
- Turing computability

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

**The computational capability of chemical reaction automata.** / Okubo, Fumiya; Yokomori, Takashi.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - The computational capability of chemical reaction automata

AU - Okubo, Fumiya

AU - Yokomori, Takashi

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Chemical reaction automata

KW - Chemical reaction networks

KW - Reaction automata

KW - Turing computability

UR - http://www.scopus.com/inward/record.url?scp=84921927541&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84921927541&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84921927541

VL - 8727

SP - 53

EP - 66

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -