Computational Hierarchy of Elementary Cellular Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00354750" target="_blank" >RIV/68407700:21730/21:00354750 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1162/isal_a_00447" target="_blank" >https://doi.org/10.1162/isal_a_00447</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1162/isal_a_00447" target="_blank" >10.1162/isal_a_00447</a>
Alternative languages
Result language
angličtina
Original language name
Computational Hierarchy of Elementary Cellular Automata
Original language description
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the ability of automata to emulate one another, and we use this notion to define such a set of naturally emerging tasks. We present the results for elementary cellular automata, although the core ideas can be extended to other computational systems. We compute a graph showing which elementary cellular automata can be emulated by which and show that certain chaotic automata are the only ones that cannot emulate any automata non-trivially. Finally, we use the emulation notion to suggest a novel definition of chaos that we believe is suitable for discrete computational systems. We believe our work can help design parallel computational systems that are Turing-complete and also computationally efficient.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
ALIFE 2021: The 2021 Conference on Artificial Life
ISBN
—
ISSN
1530-9185
e-ISSN
1530-9185
Number of pages
8
Pages from-to
—
Publisher name
The MIT Press
Place of publication
Cambridge
Event location
Praha
Event date
Jul 19, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—