TY - JOUR

T1 - The computational capability of chemical reaction automata

AU - Okubo, Fumiya

AU - Yokomori, Takashi

N1 - Funding Information:
The work of F. Okubo was in part supported by Grants-in-Aid for JSPS Fellows No. 25.3528, Japan Society for the Promotion of Science. The work of T. Yokomori was in part supported by a Grant-in-Aid for Scientific Research on Innovative Areas “Molecular Robotics” (No. 24104003) of The Ministry of Education, Culture, Sports, Science, and Technology, Japan, and by Waseda University grant for Special Research Projects: 2013B-063 and 2013C-159.
Publisher Copyright:
© 2015, Springer Science+Business Media Dordrecht.

PY - 2016/6/1

Y1 - 2016/6/1

N2 - We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant of reaction automata (RAs) studied in recent literature (Okubo in RAIRO Theor Inform Appl 48:23–38 2014; Okubo et al. in Theor Comput Sci 429:247–257 2012a, Theor Comput Sci 454:206–221 2012b). 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 (Okubo 2014; Okubo et al. 2012a). 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 (Okubo in RAIRO Theor Inform Appl 48:23–38 2014; Okubo et al. in Theor Comput Sci 429:247–257 2012a, Theor Comput Sci 454:206–221 2012b). 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 (Okubo 2014; Okubo et al. 2012a). 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=84930321565&partnerID=8YFLogxK

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

U2 - 10.1007/s11047-015-9504-7

DO - 10.1007/s11047-015-9504-7

M3 - Article

AN - SCOPUS:84930321565

VL - 15

SP - 215

EP - 224

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 2

ER -