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 Jan 1

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The computational capability of chemical reaction automata'. Together they form a unique fingerprint.

  • Cite this