Terry-Jack, Mohammed and O'Keefe, Simon orcid.org/0000-0001-5957-2474 (2023) Classifying 1D elementary cellular automata with the 0-1 test for chaos. Physica D: Nonlinear Phenomena. 133786. ISSN 0167-2789
Abstract
We utilise the 0-1 test to automatically classify elementary cellular automata. The quantitative results of the 0-1 test reveal a number of advantages over Wolfram’s qualitative classification. For instance, while almost all rules classified as chaotic by Wolfram were confirmed as such by the 0-1 test, there were two rules which were revealed to be non-chaotic. However, their periodic nature is hidden by the high complexity of their spacetime patterns and not easy to see without looking very carefully. Comparing each rule’s chaoticity (as quantified by the 0-1 test) against its intrinsic complexity (as quantified by its Chua complexity index) also reveals a number of counter-intuitive discoveries; i.e. non-chaotic dynamics are not only found in simpler rules, but also in rules as complex as chaos.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 19 Jun 2023 10:20 |
Last Modified: | 16 Oct 2024 19:12 |
Published Version: | https://doi.org/10.1016/j.physd.2023.133786 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1016/j.physd.2023.133786 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:200580 |
Download
Filename: 1_s2.0_S0167278923001409_main.pdf
Description: 1-s2.0-S0167278923001409-main
Licence: CC-BY 2.5