Computation and universality: Class IV versus Class III cellular automata

MaRDI QIDQ5396369zbMATH OpenFDO

Authors Genaro J. Martínez, Hector Zenil, Juan Carlos Seck-Tuoh-Mora

Publication date 5 February 2014

Full work available at URL https://arxiv.org/abs/1304.1242

zbMATH Keywords

attractorscellular automatachaoscomplexitycompressibilityglidersinformation theorymean field theoryunconventional computinguniversality

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Software, source code, etc. for problems pertaining to computer science (68-04) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 3896307
• scientific article; zbMATH DE number 4074492
• A full computation-relevant topological dynamics classification of elementary cellular automata
• Computational complexity of dynamical systems: the case of cellular automata
• Machines, Computations, and Universality

Cited in

(9)

• Emergence of density dynamics by surface interpolation in elementary cellular automata
• Progress, gaps and obstacles in the classification of cellular automata
• A symbolic dynamics perspective of Conway's game of life
• Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles
• Retracted: Universal computation is `almost surely' chaotic
• Logical gates via gliders collisions
• Unpredictability and entanglement in open quantum systems
• QGoL: quantum game of life
• Experimental classification of elementary cellular automata using Markov chains

Describes a project that uses

Uses Software

• DDLab

This page was built for publication: Computation and universality: Class IV versus Class III cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396369)