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 ([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 languageEnglish
    Pages (from-to)53-66
    Number of pages14
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8727
    Publication statusPublished - 2014

    Fingerprint

    Chemical Reaction
    Automata
    Chemical reactions
    Turing machines
    Computing
    Turing
    Inhibitor
    Petri nets
    Chemical Reaction Networks
    Computability
    Turing Machine
    Petri Nets
    Universality
    Model

    Keywords

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

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    @article{55b37998fa1642ca955e74b28c831c14,
    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 ([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.",
    keywords = "Chemical reaction automata, Chemical reaction networks, Reaction automata, Turing computability",
    author = "Fumiya Okubo and Takashi Yokomori",
    year = "2014",
    language = "English",
    volume = "8727",
    pages = "53--66",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    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 -