R.I.P.
π»
Ghosted
Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour
July 06, 2019 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Sergio J. Martinez, Ivan M. Mendoza, Genaro J. Martinez, Shigeru Ninagawa
arXiv ID
1907.04211
Category
nlin.CG
Cross-listed
cs.CL,
cs.DS,
cs.LO
Citations
1
Venue
arXiv.org
Last Checked
3 months ago
Abstract
Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular automaton with a 2-linear time and display its spatial dynamics. Three particular Turing machines are converted in three universal one-dimensional cellular automata, they are: binary sum, rule 110 and a universal reversible Turing machine.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β nlin.CG
R.I.P.
π»
Ghosted
Lenia - Biology of Artificial Life
R.I.P.
π»
Ghosted
Evolving Structures in Complex Systems
R.I.P.
π»
Ghosted
Implementation of Lenia as a Reaction-Diffusion System
R.I.P.
π»
Ghosted
Self-Reproduction and Evolution in Cellular Automata: 25 Years after Evoloops
R.I.P.
π»
Ghosted
The ideal energy of classical lattice dynamics
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted