A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior

We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of its neighbor cells. This framework makes it easy to...

Full description

Saved in:
Bibliographic Details
Published in:Natural computing 2019-09, Vol.18 (3), p.413-428
Main Author: Morita, Kenichi
Format: Article
Language:English
Subjects:
Artificial Intelligence
Cellular automata
Complex Systems
Computer Science
Evolutionary Biology
Gliders
Logic circuits
Processor Architectures
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493
cites cdi_FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493
container_end_page 428
container_issue 3
container_start_page 413
container_title Natural computing
container_volume 18
creator Morita, Kenichi
description We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of its neighbor cells. This framework makes it easy to design reversible triangular CAs. Among them, isotropic and eight-state (i.e., each part has only two states) TPCAs are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. In this paper, we investigate a specific reversible ETPCA T 0347 , where 0347 is its identification number in the class of 256 ETPCAs. In spite of the simplicity of the local function and the constraint of reversibility, evolutions of configurations in T 0347 have very rich varieties. It is shown that a glider, which is a space-moving pattern, and glider guns exist in this cellular space We also show that the trajectory and the timing of a glider can be fully controlled by appropriately placing stable patterns called blocks. Furthermore, using gliders to represent signals, we can implement universal reversible logic gates in it. By this, computational universality of T 0347 is derived.
doi_str_mv 10.1007/s11047-017-9655-9
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2277253787</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2277253787</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493</originalsourceid><addsrcrecordid>eNp1kMtOwzAQRSMEEqXwAewssTb4Edvxsqp4SZXYwNpykkmbKrGD7RT4exKKxIrVjGbOvaO5WXZNyS0lRN1FSkmuMKEKaykE1ifZggrFsFZans69VFgVtDjPLmLcE8KoEHSRfa7Q6NoDhGg75LzDlXcRwsGmaYgCzJu27ABBBz24ZMMXSqG1bjt2NqDBhtSm1juoUQVd9zO0Y_K9Td6htLMJxZ3_iKjy_dDBJyphZw-tD5fZWWO7CFe_dZm9Pdy_rp_w5uXxeb3a4IpTmTAnDRe8VJwVObdNXisphQZZK1sSpnWdc6orXaucy6JgAnheFhOlLOO8yTVfZjdH3yH49xFiMns_BjedNIwpxQRXhZooeqSq4GMM0JghtP30rKHEzAGbY8BmCtjMAZvZmR01cWLdFsKf8_-ib-VFgFY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2277253787</pqid></control><display><type>article</type><title>A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior</title><source>Springer Link</source><creator>Morita, Kenichi</creator><creatorcontrib>Morita, Kenichi</creatorcontrib><description>We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of its neighbor cells. This framework makes it easy to design reversible triangular CAs. Among them, isotropic and eight-state (i.e., each part has only two states) TPCAs are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. In this paper, we investigate a specific reversible ETPCA T 0347 , where 0347 is its identification number in the class of 256 ETPCAs. In spite of the simplicity of the local function and the constraint of reversibility, evolutions of configurations in T 0347 have very rich varieties. It is shown that a glider, which is a space-moving pattern, and glider guns exist in this cellular space We also show that the trajectory and the timing of a glider can be fully controlled by appropriately placing stable patterns called blocks. Furthermore, using gliders to represent signals, we can implement universal reversible logic gates in it. By this, computational universality of T 0347 is derived.</description><identifier>ISSN: 1567-7818</identifier><identifier>EISSN: 1572-9796</identifier><identifier>DOI: 10.1007/s11047-017-9655-9</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Artificial Intelligence ; Cellular automata ; Complex Systems ; Computer Science ; Evolutionary Biology ; Gliders ; Logic circuits ; Processor Architectures ; Theory of Computation</subject><ispartof>Natural computing, 2019-09, Vol.18 (3), p.413-428</ispartof><rights>Springer Science+Business Media B.V., part of Springer Nature 2017</rights><rights>Natural Computing is a copyright of Springer, (2017). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493</citedby><cites>FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493</cites><orcidid>0000-0002-9833-0539</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,786,790,27957,27958</link.rule.ids></links><search><creatorcontrib>Morita, Kenichi</creatorcontrib><title>A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior</title><title>Natural computing</title><addtitle>Nat Comput</addtitle><description>We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of its neighbor cells. This framework makes it easy to design reversible triangular CAs. Among them, isotropic and eight-state (i.e., each part has only two states) TPCAs are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. In this paper, we investigate a specific reversible ETPCA T 0347 , where 0347 is its identification number in the class of 256 ETPCAs. In spite of the simplicity of the local function and the constraint of reversibility, evolutions of configurations in T 0347 have very rich varieties. It is shown that a glider, which is a space-moving pattern, and glider guns exist in this cellular space We also show that the trajectory and the timing of a glider can be fully controlled by appropriately placing stable patterns called blocks. Furthermore, using gliders to represent signals, we can implement universal reversible logic gates in it. By this, computational universality of T 0347 is derived.</description><subject>Artificial Intelligence</subject><subject>Cellular automata</subject><subject>Complex Systems</subject><subject>Computer Science</subject><subject>Evolutionary Biology</subject><subject>Gliders</subject><subject>Logic circuits</subject><subject>Processor Architectures</subject><subject>Theory of Computation</subject><issn>1567-7818</issn><issn>1572-9796</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1kMtOwzAQRSMEEqXwAewssTb4Edvxsqp4SZXYwNpykkmbKrGD7RT4exKKxIrVjGbOvaO5WXZNyS0lRN1FSkmuMKEKaykE1ifZggrFsFZans69VFgVtDjPLmLcE8KoEHSRfa7Q6NoDhGg75LzDlXcRwsGmaYgCzJu27ABBBz24ZMMXSqG1bjt2NqDBhtSm1juoUQVd9zO0Y_K9Td6htLMJxZ3_iKjy_dDBJyphZw-tD5fZWWO7CFe_dZm9Pdy_rp_w5uXxeb3a4IpTmTAnDRe8VJwVObdNXisphQZZK1sSpnWdc6orXaucy6JgAnheFhOlLOO8yTVfZjdH3yH49xFiMns_BjedNIwpxQRXhZooeqSq4GMM0JghtP30rKHEzAGbY8BmCtjMAZvZmR01cWLdFsKf8_-ib-VFgFY</recordid><startdate>20190901</startdate><enddate>20190901</enddate><creator>Morita, Kenichi</creator><general>Springer Netherlands</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-9833-0539</orcidid></search><sort><creationdate>20190901</creationdate><title>A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior</title><author>Morita, Kenichi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Artificial Intelligence</topic><topic>Cellular automata</topic><topic>Complex Systems</topic><topic>Computer Science</topic><topic>Evolutionary Biology</topic><topic>Gliders</topic><topic>Logic circuits</topic><topic>Processor Architectures</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Morita, Kenichi</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest Science Journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Natural computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Morita, Kenichi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior</atitle><jtitle>Natural computing</jtitle><stitle>Nat Comput</stitle><date>2019-09-01</date><risdate>2019</risdate><volume>18</volume><issue>3</issue><spage>413</spage><epage>428</epage><pages>413-428</pages><issn>1567-7818</issn><eissn>1572-9796</eissn><abstract>We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of its neighbor cells. This framework makes it easy to design reversible triangular CAs. Among them, isotropic and eight-state (i.e., each part has only two states) TPCAs are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. In this paper, we investigate a specific reversible ETPCA T 0347 , where 0347 is its identification number in the class of 256 ETPCAs. In spite of the simplicity of the local function and the constraint of reversibility, evolutions of configurations in T 0347 have very rich varieties. It is shown that a glider, which is a space-moving pattern, and glider guns exist in this cellular space We also show that the trajectory and the timing of a glider can be fully controlled by appropriately placing stable patterns called blocks. Furthermore, using gliders to represent signals, we can implement universal reversible logic gates in it. By this, computational universality of T 0347 is derived.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s11047-017-9655-9</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0002-9833-0539</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1567-7818
ispartof Natural computing, 2019-09, Vol.18 (3), p.413-428
issn 1567-7818
1572-9796
language eng
recordid cdi_proquest_journals_2277253787
source Springer Link
subjects Artificial Intelligence
Cellular automata
Complex Systems
Computer Science
Evolutionary Biology
Gliders
Logic circuits
Processor Architectures
Theory of Computation
title A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T04%3A28%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20universal%20non-conservative%20reversible%20elementary%20triangular%20partitioned%20cellular%20automaton%20that%20shows%20complex%20behavior&rft.jtitle=Natural%20computing&rft.au=Morita,%20Kenichi&rft.date=2019-09-01&rft.volume=18&rft.issue=3&rft.spage=413&rft.epage=428&rft.pages=413-428&rft.issn=1567-7818&rft.eissn=1572-9796&rft_id=info:doi/10.1007/s11047-017-9655-9&rft_dat=%3Cproquest_cross%3E2277253787%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c316t-30f353b732843af4d76659e6d7ab0299d4319c9d74368825e34b84d77a233f493%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2277253787&rft_id=info:pmid/&rfr_iscdi=true