Related papers: A gauge-invariant reversible cellular automaton
We introduce a numerical method, based on finite elements and lattice gauge theory, to compute approximate solutions to Schr\"odinger and Pauli equations. The crucial geometric property of the method is discrete gauge invariance. The main…
Variational calculations using Gaussian wave functionals combined with an approximate projection on gauge invariant states are presented. We find that the energy exhibits a minimum for a wave functional centered around a non vanishing…
Three techniques for performing gauge-invariant, noncompact lattice simulations of nonabelian gauge theories are discussed. In the first method, the action is not itself gauge invariant, but a kind of lattice gauge invariance is restored by…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…
The use of proper time as a tool for causality implementation in field theory is clarified and extended to allow a manifestly covariant definition of discrete fields proper to be applied in field theory and quantum mechanics. It implies on…
Previous analyses on the gauge invariance of the action for a generally covariant system are generalized. It is shown that if the action principle is properly improved, there is as much gauge freedom at the endpoints for an arbitrary gauge…
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
We discuss the action principle and resulting Hamiltonian equations of motion for a class of integer-valued cellular automata introduced recently [1]. Employing sampling theory, these deterministic finite-difference equations are mapped…
The idea of gauging (i.e. making local) symmetries of a physical system is a central feature of many modern field theories. Usually, one starts with a Lagrangian for some scalar or spinor matter fields, with the Lagrangian being invariant…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
We derive a relation between four-fermion QED Green functions of different covariant gauges which defines the gauge dependence completely. We use the derived gauge dependence to check the gauge invariance of atom-like bound state…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
For any group $G$ and any set $A$, a cellular automaton (CA) is a transformation of the configuration space $A^G$ defined via a finite memory set and a local function. Let $\text{CA}(G;A)$ be the monoid of all CA over $A^G$. In this paper,…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
Partitioned cellular automata are known to be an useful tool to simulate linear and nonlinear problems in physics, specially because they allow for a straightforward way to define conserved quantities and reversible dynamics. Here we show…
We show that it is possible to formulate a gauge theory starting from a local action at the ultraviolet (UV) momentum cutoff which is BRS invariant. One has to require that fields in the UV action and the fields in the effective action are…
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…