Related papers: On complexity of colloid cellular automata
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…
We formulate a new concept for computing with quantum cellular automata composed of arrays of nanostructured superconducting devices. The logic states are defined by the position of two trapped flux quanta (vortices) in a 2x2…
Neurons are modeled electrically based on ferroelectric membranes thin enough to permit charge transfer, conjectured to be the tunneling result of thermally energetic ions and random electrons. These membranes can be triggered to produce…
The spatial structure of the cell is highly organized at all levels: from small complexes and assemblies, to local nano- and micro-clusters, to global, micrometer scales across and between cells. We suggest that this multiscale spatial cell…
Soft materials, such as colloidal suspensions, polymer solutions, and biological systems, are typically multicomponent mixtures of macromolecules and simpler components (e.g., microions, monomers, solvent) that can assemble into complex…
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…
Living cells dynamically modulate the local morphologies of their actin cytoskeletons to perform biological functions, including force transduction, intracellular transport, and cell division. A major challenge is to understand how diverse…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
Buildup and switching mechanisms of solitons in complex nonlinear systems are fundamentally important dynamical regimes. Using a novel strongly nonlinear optical system,the work reveals a new buildup scenario for soliton molecules , which…
Quantum-dot Cellular Automata (QCA) provides a basis for classical computation without transistors. Many simulations of QCA rely upon the so-called Intercellular Hartree Approximation (ICHA), which neglects the possibility of entanglement…
Previous models of the cerebrovascular smooth muscle cell have not addressed the interaction between the electrical, chemical and mechanical components of cell function during the development of active tension. These models are primarily…
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…
Biological motors are marvels of nature that inspire creation of their synthetic counterparts with comparable nanoscale dimensions, high efficiency and diverse functions. Molecular motors have been synthesized, but obtaining nanomotors…
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a…
The conformation space of cyclooctane, a ringlike organic molecule comprising eight carbon atoms, is a two-dimensional algebraic variety, which has been studied extensively for more than 90 years. We propose a cell structure representing…
We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators.…