Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Mean-Field Analysis with Random Perturbations to Detect Gliders in Cellular Automata

Version 1 : Received: 15 September 2023 / Approved: 18 September 2023 / Online: 19 September 2023 (15:27:10 CEST)

A peer-reviewed article of this Preprint also exists.

Seck-Tuoh-Mora, J.C.; Medina-Marin, J.; Hernández-Romero, N.; Martínez, G.J. Mean-Field Analysis with Random Perturbations to Detect Gliders in Cellular Automata. Mathematics 2023, 11, 4319. Seck-Tuoh-Mora, J.C.; Medina-Marin, J.; Hernández-Romero, N.; Martínez, G.J. Mean-Field Analysis with Random Perturbations to Detect Gliders in Cellular Automata. Mathematics 2023, 11, 4319.

Abstract

Cellular automata are mathematical models that represent systems with complex behavior through simple interactions between their individual elements. These models can be used to study unconventional computational systems and complexity. One notable aspect of cellular automata is their ability to create structures known as gliders, which move in a regular pattern to represent the manipulation of information. This paper introduces the modification of mean-field theory applied to cellular automata, using random perturbations based on the system’s evolution rule. The original aspect of this approach is that the perturbation factor is tailored to the nature of the rule, altering the behavior of the mean-field polynomials. By combining the properties of both the original and perturbed polynomials, it is possible to detect when a cellular automaton is more likely to generate gliders without having to run evolutions of the system.This methodology is a useful approach to finding more examples of cellular automata that exhibit complex behavior. We start by examining elementary cellular automata, then move on to examples of automata that can generate gliders with more states. To illustrate the results of this methodology, we provide evolution examples of the detected automata.

Keywords

cellular automata; mean-field theory; gliders detection; complexity; random amplification

Subject

Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.