Universal totalistic asynchonous cellular automaton and its possible implementation by DNA

Teijiro Isokawa; Ferdinand Peper; Ibuki Kawamata; Nobuyuki Matsui; Satoshi Murata; Masami Hagiya

doi:10.1007/978-3-319-41312-9_15

Universal totalistic asynchonous cellular automaton and its possible implementation by DNA

Teijiro Isokawa, Ferdinand Peper, Ibuki Kawamata, Nobuyuki Matsui, Satoshi Murata, Masami Hagiya

ENG - Robotics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

Abstract

This paper presents a Cellular Automaton (CA) model designed for possible implementation by the reaction and diffusion of DNA strands. The proposed CA works asynchronously, whereby each cell undergoes its transitions independently from other cells and at random times. The state of a cell changes in a cyclic manner, rather than according to an any-to-any mapping. The transition rules are designed as totalistic, i.e., the next state of a cell is determined only by the number of states in the neighborhood of the cell, not by their relative positions. Universal circuit elements are designed for the CA as well as wires and crossings to connect them, which implies that the CA is Turing-complete.

Original language	English
Title of host publication	Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings
Editors	Anne Condon, Martyn Amos
Publisher	Springer-Verlag
Pages	182-195
Number of pages	14
ISBN (Print)	9783319413112
DOIs	https://doi.org/10.1007/978-3-319-41312-9_15
Publication status	Published - 2016 Jan 1
Event	15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016 - Manchester, United Kingdom Duration: 2016 Jul 11 → 2016 Jul 15

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9726
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016
Country	United Kingdom
City	Manchester
Period	16/7/11 → 16/7/15

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-41312-9_15

Fingerprint Dive into the research topics of 'Universal totalistic asynchonous cellular automaton and its possible implementation by DNA'. Together they form a unique fingerprint.

Cite this

Isokawa, T., Peper, F., Kawamata, I., Matsui, N., Murata, S., & Hagiya, M. (2016). Universal totalistic asynchonous cellular automaton and its possible implementation by DNA. In A. Condon, & M. Amos (Eds.), Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings (pp. 182-195). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9726). Springer-Verlag. https://doi.org/10.1007/978-3-319-41312-9_15

Universal totalistic asynchonous cellular automaton and its possible implementation by DNA. / Isokawa, Teijiro; Peper, Ferdinand; Kawamata, Ibuki; Matsui, Nobuyuki; Murata, Satoshi; Hagiya, Masami.

Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings. ed. / Anne Condon; Martyn Amos. Springer-Verlag, 2016. p. 182-195 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9726).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Isokawa, T, Peper, F, Kawamata, I, Matsui, N, Murata, S & Hagiya, M 2016, Universal totalistic asynchonous cellular automaton and its possible implementation by DNA. in A Condon & M Amos (eds), Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9726, Springer-Verlag, pp. 182-195, 15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016, Manchester, United Kingdom, 16/7/11. https://doi.org/10.1007/978-3-319-41312-9_15

Isokawa T, Peper F, Kawamata I, Matsui N, Murata S, Hagiya M. Universal totalistic asynchonous cellular automaton and its possible implementation by DNA. In Condon A, Amos M, editors, Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings. Springer-Verlag. 2016. p. 182-195. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-41312-9_15

Isokawa, Teijiro ; Peper, Ferdinand ; Kawamata, Ibuki ; Matsui, Nobuyuki ; Murata, Satoshi ; Hagiya, Masami. / Universal totalistic asynchonous cellular automaton and its possible implementation by DNA. Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings. editor / Anne Condon ; Martyn Amos. Springer-Verlag, 2016. pp. 182-195 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2087ab5dd086426eb86873341f3b5ca9,

title = "Universal totalistic asynchonous cellular automaton and its possible implementation by DNA",

abstract = "This paper presents a Cellular Automaton (CA) model designed for possible implementation by the reaction and diffusion of DNA strands. The proposed CA works asynchronously, whereby each cell undergoes its transitions independently from other cells and at random times. The state of a cell changes in a cyclic manner, rather than according to an any-to-any mapping. The transition rules are designed as totalistic, i.e., the next state of a cell is determined only by the number of states in the neighborhood of the cell, not by their relative positions. Universal circuit elements are designed for the CA as well as wires and crossings to connect them, which implies that the CA is Turing-complete.",

author = "Teijiro Isokawa and Ferdinand Peper and Ibuki Kawamata and Nobuyuki Matsui and Satoshi Murata and Masami Hagiya",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-3-319-41312-9_15",

language = "English",

isbn = "9783319413112",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "182--195",

editor = "Anne Condon and Martyn Amos",

booktitle = "Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings",

note = "15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016 ; Conference date: 11-07-2016 Through 15-07-2016",

}

TY - GEN

T1 - Universal totalistic asynchonous cellular automaton and its possible implementation by DNA

AU - Isokawa, Teijiro

AU - Peper, Ferdinand

AU - Kawamata, Ibuki

AU - Matsui, Nobuyuki

AU - Murata, Satoshi

AU - Hagiya, Masami

PY - 2016/1/1

Y1 - 2016/1/1

N2 - This paper presents a Cellular Automaton (CA) model designed for possible implementation by the reaction and diffusion of DNA strands. The proposed CA works asynchronously, whereby each cell undergoes its transitions independently from other cells and at random times. The state of a cell changes in a cyclic manner, rather than according to an any-to-any mapping. The transition rules are designed as totalistic, i.e., the next state of a cell is determined only by the number of states in the neighborhood of the cell, not by their relative positions. Universal circuit elements are designed for the CA as well as wires and crossings to connect them, which implies that the CA is Turing-complete.

AB - This paper presents a Cellular Automaton (CA) model designed for possible implementation by the reaction and diffusion of DNA strands. The proposed CA works asynchronously, whereby each cell undergoes its transitions independently from other cells and at random times. The state of a cell changes in a cyclic manner, rather than according to an any-to-any mapping. The transition rules are designed as totalistic, i.e., the next state of a cell is determined only by the number of states in the neighborhood of the cell, not by their relative positions. Universal circuit elements are designed for the CA as well as wires and crossings to connect them, which implies that the CA is Turing-complete.

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

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

U2 - 10.1007/978-3-319-41312-9_15

DO - 10.1007/978-3-319-41312-9_15

M3 - Conference contribution

AN - SCOPUS:84977534315

SN - 9783319413112

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 182

EP - 195

BT - Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Proceedings

A2 - Condon, Anne

A2 - Amos, Martyn

PB - Springer-Verlag

T2 - 15th International Conference on Unconventional Computation and Natural Computation, UCNC 2016

Y2 - 11 July 2016 through 15 July 2016

ER -