Post-apocalyptic computing from cellular automata

• URL: http://arxiv.org/abs/2508.06035v1
• Date: Fri, 08 Aug 2025 05:40:58 GMT
• Title: Post-apocalyptic computing from cellular automata
• Authors: Genaro J. Martinez, Andrew Adamatzky, Guanrong Chen,
• Abstract summary: Cellular automata are arrays of finite state machines that can exist in a finite number of states.<n>We propose a novel perspective in which algorithms are represented through the dynamic state-space configurations of cellular automata.<n>This approach paves the way for the future development of unconventional computing devices.
• Score: 9.643052486977671
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a simple yet powerful model for studying complex systems and emergent behaviors. We revisit and reconsider the traditional notion of an algorithm, proposing a novel perspective in which algorithms are represented through the dynamic state-space configurations of cellular automata. By doing so, we establish a conceptual framework that connects computation to physical processes in a unique and innovative way. This approach not only enhances our understanding of computation but also paves the way for the future development of unconventional computing devices. Such devices could be engineered to leverage the inherent computational capabilities of physical, chemical, and biological substrates. This opens up new possibilities for designing systems that are more efficient, adaptive, and capable of solving problems in ways that traditional silicon-based computers cannot. The integration of cellular automata into these domains highlights their potential as a transformative tool in the ongoing evolution of computational theory and practice.

Related papers

• AI4X Roadmap: Artificial Intelligence for the advancement of scientific pursuit and its future directions [65.44445343399126]
  We look at AI-enabled science across biology, chemistry, climate science, mathematics, materials science, physics, self-driving laboratories and unconventional computing.<n>Several shared themes emerge: the need for diverse and trustworthy data, transferable electronic-structure and interatomic models, AI systems integrated into end-to-end scientific synthesis.<n>Across domains, we highlight how large foundation models, active learning and self-driving laboratories can close loops between prediction and validation.
  arXiv  Detail & Related papers  (2025-11-26T02:10:28Z)
• A Path to Universal Neural Cellular Automata [6.7822488410082755]
  This work explores the potential of neural cellular automata to develop a continuous Universal Cellular Automaton.<n>We introduce a cellular automaton model, objective functions and training strategies to guide neural cellular automata toward universal computation in a continuous setting.
  arXiv  Detail & Related papers  (2025-05-19T12:46:01Z)
• Training Neural Networks with Internal State, Unconstrained Connectivity, and Discrete Activations [66.53734987585244]
  True intelligence may require the ability of a machine learning model to manage internal state. We show that we have not yet discovered the most effective algorithms for training such models. We present one attempt to design such a training algorithm, applied to an architecture with binary activations and only a single matrix of weights.
  arXiv  Detail & Related papers  (2023-12-22T01:19:08Z)
• Neural Operators for Accelerating Scientific Simulations and Design [85.89660065887956]
  An AI framework, known as Neural Operators, presents a principled framework for learning mappings between functions defined on continuous domains. Neural Operators can augment or even replace existing simulators in many applications, such as computational fluid dynamics, weather forecasting, and material modeling.
  arXiv  Detail & Related papers  (2023-09-27T00:12:07Z)
• A Survey on Brain-Inspired Deep Learning via Predictive Coding [85.93245078403875]
  Predictive coding (PC) has shown promising performance in machine intelligence tasks.<n>PC can model information processing in different brain areas, can be used in cognitive control and robotics.
  arXiv  Detail & Related papers  (2023-08-15T16:37:16Z)
• A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms [0.014319921806060482]
  We provide a full-stack review of probabilistic computing with p-bits. We argue that p-bits could be used to build energy-efficient probabilistic systems. We outline the main applications of probabilistic computers ranging from machine learning to AI.
  arXiv  Detail & Related papers  (2023-02-13T15:36:07Z)
• Neuromechanical Autoencoders: Learning to Couple Elastic and Neural Network Nonlinearity [15.47367187516723]
  We seek to develop machine learning analogs of. mechanical intelligence. We jointly learn the morphology of complex nonlinear elastic solids along with a. deep neural network to control it.
  arXiv  Detail & Related papers  (2023-01-31T19:04:28Z)
• A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks [65.34977803841007]
  Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. We show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one.
  arXiv  Detail & Related papers  (2022-11-16T00:11:04Z)
• Neurocompositional computing: From the Central Paradox of Cognition to a new generation of AI systems [120.297940190903]
  Recent progress in AI has resulted from the use of limited forms of neurocompositional computing. New, deeper forms of neurocompositional computing create AI systems that are more robust, accurate, and comprehensible.
  arXiv  Detail & Related papers  (2022-05-02T18:00:10Z)
• Computational Hierarchy of Elementary Cellular Automata [0.0]
  We study the ability of cellular automata to emulate one another. We show that certain chaotic automata are the only ones that cannot emulate any automata non-trivially. We believe our work can help design parallel computational systems that are Turing-complete and also computationally efficient.
  arXiv  Detail & Related papers  (2021-08-01T10:00:54Z)
• Visualizing computation in large-scale cellular automata [24.62657948019533]
  Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity. We propose methods for coarse-graining cellular automata based on frequency analysis of cell states, clustering and autoencoders.
  arXiv  Detail & Related papers  (2021-04-01T08:14:15Z)
• Spiking Neural Networks Hardware Implementations and Challenges: a Survey [53.429871539789445]
  Spiking Neural Networks are cognitive algorithms mimicking neuron and synapse operational principles. We present the state of the art of hardware implementations of spiking neural networks. We discuss the strategies employed to leverage the characteristics of these event-driven algorithms at the hardware level.
  arXiv  Detail & Related papers  (2020-05-04T13:24:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.