The computational capability of chemical reaction automata

Fumiya Okubo, Takashi Yokomori

    Research output: Contribution to journalArticle

    3 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    JournalNatural Computing
    DOIs
    Publication statusAccepted/In press - 2015 Jun 2

    Fingerprint

    Chemical reactions
    Turing machines
    Petri nets

    Keywords

    • Chemical reaction automata
    • Chemical reaction networks
    • Reaction automata
    • Turing computability

    ASJC Scopus subject areas

    • Computer Science Applications

    Cite this

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

    In: Natural Computing, 02.06.2015.

    Research output: Contribution to journalArticle

    @article{7f49f38406904ee4b9018a9fea2e55e9,
    title = "The computational capability of chemical reaction automata",
    abstract = "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.",
    keywords = "Chemical reaction automata, Chemical reaction networks, Reaction automata, Turing computability",
    author = "Fumiya Okubo and Takashi Yokomori",
    year = "2015",
    month = "6",
    day = "2",
    doi = "10.1007/s11047-015-9504-7",
    language = "English",
    journal = "Natural Computing",
    issn = "1567-7818",
    publisher = "Springer Netherlands",

    }

    TY - JOUR

    T1 - The computational capability of chemical reaction automata

    AU - Okubo, Fumiya

    AU - Yokomori, Takashi

    PY - 2015/6/2

    Y1 - 2015/6/2

    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

    JO - Natural Computing

    JF - Natural Computing

    SN - 1567-7818

    ER -