Are quantum fields cellular automata?

doi:10.1016/0375-9601(86)90436-6

Physics Letters A

Volume 119, Issue 4, 15 December 1986, Pages 153-156

https://doi.org/10.1016/0375-9601(86)90436-6 Get rights and content

Abstract

Tesselation of the quantum field and local connectivity of the cellular automaton type is investigated. A connection between this class of models and lattice field theory is established. Nonlocal models are briefly discussed.

References (15)

G.Y. Vichniac
Physica D
(1984)
T. Toffoli
Physica D
(1984)
N. Margolus
Physica D
(1984)
H.B. Nielsen et al.
Nucl. Phys. B
(1981)
H.B. Nielsen et al.
Nucl. Phys. B
(1981)
L.H. Karsten et al.
Nucl. Phys. B
(1981)
J.M. Rabin
Phys. Rev. D
(1982)
C.H. Woo
Phys. Lett. B
(1986)

There are more references available in the full text version of this article.

Cited by (12)

Reversible cellular automata with memory: Two-dimensional patterns from a single site seed
2003, Physica D: Nonlinear Phenomena
Standard cellular automata (CA) are ahistoric (memoryless), i.e., the new state of a cell depends on its neighborhood configuration only at the preceding time step. Historic memory of all past iterations can be incorporated into CA by featuring each cell by a weighted mean of all its past states. In this paper, a new kind of reversible CA, which incorporates memory, is introduced in a two-dimensional scenario.
Constructive chaos by cellular automata and possible sources of an arrow of time
1990, Physica D: Nonlinear Phenomena
Present notions of chaos and their characterization by complexity measures are critically reviewed. The possible causes for the induction of an arrow of time are discussed: First, the intrinsic undecidability for the determination of complexity and the associated entropy measures may result in a time asymmetry even for finite reversible evolution laws. Second, the employment of transfinite resources (such as the infinite time limit) may result in an uncomputable final state from reversible evolution laws and computable initial values. Third, the existence of recursively enumerable reversible cellular automata rules whose inverse are not recursively enumerable is conjectured.
Fundamental Physics and Computation: The Computer-Theoretic Framework
2022, Universe
A class of models with the potential to represent fundamental physics
2020, Complex Systems
Automated segmentation of hyperreflective foci in spectral domain optical coherence tomography with diabetic retinopathy
2018, Journal of Medical Imaging
Structurally Dynamic Cellular Networks as Models for Planck Scale Physics and the Quantum Vacuum
2016, Beyond Peaceful Coexistence: The Emergence of Space, Time and Quantum

View all citing articles on Scopus

View full text

Are quantum fields cellular automata?

Abstract

Physica D

Physica D

Physica D

Nucl. Phys. B

Nucl. Phys. B

Nucl. Phys. B

Phys. Rev. D

Phys. Lett. B