Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond

Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond

Random Boolean networks (RBN) and Cellular Automata (CA) operate in a very similar way. They update their state with simple deterministic functions called Boolean function or Transition Table (TT), both being essentially the same mechanism under different names. This paper applies a concept most kno...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference 2023
Hauptverfasser: Glover, Tom Eivind, Jahren, Christian Ruben, Huse Ramstad, Ola, Nichele, Stefano
Format: Artikel
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference
container_volume
creator Glover, Tom Eivind
Jahren, Christian Ruben
Huse Ramstad, Ola
Nichele, Stefano
description Random Boolean networks (RBN) and Cellular Automata (CA) operate in a very similar way. They update their state with simple deterministic functions called Boolean function or Transition Table (TT), both being essentially the same mechanism under different names. This paper applies a concept most known from CA called Minimum Equivalence (ME). ME is applied to RBN and shows how to calculate the number of unique computations for a given number of neighbours. Crucially, it is shown how RBN rules are even more equivalent than in CA, how the set can be reduced into even fewer unique rules, and how the concept becomes more relevant with larger neighbourhoods. For example, switching transformation alone reduces the number of unique rules in RBN with 4 neighbours from 65 536 to only 3 984 (6.1%) rules. Additionally, this paper examines the ME and transformations in substrates beyond Elementary CA (ECA), such as CA with additional spatial dimensions and number of states.
format Article
fullrecord <record><control><sourceid>cristin_3HK</sourceid><recordid>TN_cdi_cristin_nora_11250_3101037</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>11250_3101037</sourcerecordid><originalsourceid>FETCH-cristin_nora_11250_31010373</originalsourceid><addsrcrecordid>eNqNyz0KwkAQQOE0FqLeYewjZA1ibcKKjRZiYReGZAKLszO4P0pur4UHsHrN9-bF_ezE-ezBPrN7IZP0BE7gijKoh0aVCQUulN4aHrEEy-RJEoYJWmLOjAEOOanHhCV8L2hoUhmWxWxEjrT6dVGsj_bWnjZ9cDE56UQDdsZsd1VXm8pU9b7-x3wAQVM5Hg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond</title><source>NORA - Norwegian Open Research Archives</source><creator>Glover, Tom Eivind ; Jahren, Christian Ruben ; Huse Ramstad, Ola ; Nichele, Stefano</creator><creatorcontrib>Glover, Tom Eivind ; Jahren, Christian Ruben ; Huse Ramstad, Ola ; Nichele, Stefano</creatorcontrib><description>Random Boolean networks (RBN) and Cellular Automata (CA) operate in a very similar way. They update their state with simple deterministic functions called Boolean function or Transition Table (TT), both being essentially the same mechanism under different names. This paper applies a concept most known from CA called Minimum Equivalence (ME). ME is applied to RBN and shows how to calculate the number of unique computations for a given number of neighbours. Crucially, it is shown how RBN rules are even more equivalent than in CA, how the set can be reduced into even fewer unique rules, and how the concept becomes more relevant with larger neighbourhoods. For example, switching transformation alone reduces the number of unique rules in RBN with 4 neighbours from 65 536 to only 3 984 (6.1%) rules. Additionally, this paper examines the ME and transformations in substrates beyond Elementary CA (ECA), such as CA with additional spatial dimensions and number of states.</description><language>eng</language><ispartof>ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference, 2023</ispartof><rights>info:eu-repo/semantics/openAccess</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,780,885,26567</link.rule.ids><linktorsrc>$$Uhttp://hdl.handle.net/11250/3101037$$EView_record_in_NORA$$FView_record_in_$$GNORA$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Glover, Tom Eivind</creatorcontrib><creatorcontrib>Jahren, Christian Ruben</creatorcontrib><creatorcontrib>Huse Ramstad, Ola</creatorcontrib><creatorcontrib>Nichele, Stefano</creatorcontrib><title>Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond</title><title>ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference</title><description>Random Boolean networks (RBN) and Cellular Automata (CA) operate in a very similar way. They update their state with simple deterministic functions called Boolean function or Transition Table (TT), both being essentially the same mechanism under different names. This paper applies a concept most known from CA called Minimum Equivalence (ME). ME is applied to RBN and shows how to calculate the number of unique computations for a given number of neighbours. Crucially, it is shown how RBN rules are even more equivalent than in CA, how the set can be reduced into even fewer unique rules, and how the concept becomes more relevant with larger neighbourhoods. For example, switching transformation alone reduces the number of unique rules in RBN with 4 neighbours from 65 536 to only 3 984 (6.1%) rules. Additionally, this paper examines the ME and transformations in substrates beyond Elementary CA (ECA), such as CA with additional spatial dimensions and number of states.</description><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>3HK</sourceid><recordid>eNqNyz0KwkAQQOE0FqLeYewjZA1ibcKKjRZiYReGZAKLszO4P0pur4UHsHrN9-bF_ezE-ezBPrN7IZP0BE7gijKoh0aVCQUulN4aHrEEy-RJEoYJWmLOjAEOOanHhCV8L2hoUhmWxWxEjrT6dVGsj_bWnjZ9cDE56UQDdsZsd1VXm8pU9b7-x3wAQVM5Hg</recordid><startdate>2023</startdate><enddate>2023</enddate><creator>Glover, Tom Eivind</creator><creator>Jahren, Christian Ruben</creator><creator>Huse Ramstad, Ola</creator><creator>Nichele, Stefano</creator><scope>3HK</scope></search><sort><creationdate>2023</creationdate><title>Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond</title><author>Glover, Tom Eivind ; Jahren, Christian Ruben ; Huse Ramstad, Ola ; Nichele, Stefano</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-cristin_nora_11250_31010373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Glover, Tom Eivind</creatorcontrib><creatorcontrib>Jahren, Christian Ruben</creatorcontrib><creatorcontrib>Huse Ramstad, Ola</creatorcontrib><creatorcontrib>Nichele, Stefano</creatorcontrib><collection>NORA - Norwegian Open Research Archives</collection><jtitle>ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Glover, Tom Eivind</au><au>Jahren, Christian Ruben</au><au>Huse Ramstad, Ola</au><au>Nichele, Stefano</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond</atitle><jtitle>ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference</jtitle><date>2023</date><risdate>2023</risdate><abstract>Random Boolean networks (RBN) and Cellular Automata (CA) operate in a very similar way. They update their state with simple deterministic functions called Boolean function or Transition Table (TT), both being essentially the same mechanism under different names. This paper applies a concept most known from CA called Minimum Equivalence (ME). ME is applied to RBN and shows how to calculate the number of unique computations for a given number of neighbours. Crucially, it is shown how RBN rules are even more equivalent than in CA, how the set can be reduced into even fewer unique rules, and how the concept becomes more relevant with larger neighbourhoods. For example, switching transformation alone reduces the number of unique rules in RBN with 4 neighbours from 65 536 to only 3 984 (6.1%) rules. Additionally, this paper examines the ME and transformations in substrates beyond Elementary CA (ECA), such as CA with additional spatial dimensions and number of states.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof ALIFE 2023: Ghost in the Machine: Proceedings of the 2023 Artificial Life Conference, 2023
issn
language eng
recordid cdi_cristin_nora_11250_3101037
source NORA - Norwegian Open Research Archives
title Minimum Equivalence in Random Boolean Networks, Elementary Cellular Automata, and Beyond
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T07%3A36%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-cristin_3HK&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimum%20Equivalence%20in%20Random%20Boolean%20Networks,%20Elementary%20Cellular%20Automata,%20and%20Beyond&rft.jtitle=ALIFE%202023:%20Ghost%20in%20the%20Machine:%20Proceedings%20of%20the%202023%20Artificial%20Life%20Conference&rft.au=Glover,%20Tom%20Eivind&rft.date=2023&rft_id=info:doi/&rft_dat=%3Ccristin_3HK%3E11250_3101037%3C/cristin_3HK%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true