Related papers: Exploring Ancient Architectural Designs with Cellu…
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with…
The architecture has its basis in a dialectic search of new choices of representation. We deal with the form on the contemporary architecture under two approaches: expression and content. We examine how mathematical principles based on…
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
Efficient encoding and representation of large 3D molecular structures with high fidelity is critical for biomolecular design applications. Despite this, many representation learning approaches restrict themselves to modeling smaller…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
This study integrates pedestrian flow characteristics to formulate a mesoscopic cellular automata model tailored for simulating evacuations in large-scale scenarios. Departing from the conventional planar grid cell division, the model…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
This paper presents an application of the Infinite Unit Axiom, introduced by Yaroslav Sergeyev, (see [11] - [14]) to the development of one-dimensional cellular automata. This application allows the establishment of a new and more precise…
We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models, and we characterise their quantum phase transition, when in the presence of a…
We demonstrate the power of the genetic algorithms to construct the cellular automata model simulating the growth of 2-dimensional close-to-circular clusters revealing the desired properties, such as the growth rate and, at the same time,…
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets…
We present herein an introduction to implementing 2-color cellular automata on quantum annealing systems, such as the D-Wave quantum computer. We show that implementing nearest-neighbor cellular automata is possible. We present an…
We study the tiling of a two-dimensional region of the plane by $K$-cell one-dimensional tiles, or $K$-mers. Unlike previous studies, which typically allowed for one single value of $K$ or sometimes a small assortment of fixed values, here…
With the development of remote sensing technology in recent decades, spaceborne sensors with sub-meter and meter spatial resolution (Worldview and PlanetScope) have achieved a considerable image quality to generate 3D geospatial data via a…
A numerical model is developed for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbors according to established…
We present Anubuddhi, a multi-agent AI system that designs and simulates quantum optics experiments from natural language prompts without requiring specialized programming knowledge. The system composes optical layouts by arranging…
A cellular automaton is presented whose governing rule is that the Kolmogorov complexity of a cell's neighborhood may not increase when the cell's present value is substituted for its future value. Using an approximation of this…
The purpose of this study is the design model of Islamic bank socialization in terms of four pillars (Business Institution, Formal Education, Islamic Scholar and Higher Education) through Synergy and Proactive. The location of the study was…
We study one-dimensional cellular automata evolutions with both temporal and spatial periodicity. The main objective is to investigate the longest temporal periods among all two-neighbor rules, with a fixed spatial period $\sigma$ and…