Cellular automata universality revisited

DOI10.1007/BFb0036195MaRDI QIDQ5055946

No author found.

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Cellular automata (computational aspects) (68Q80)

Related Items (2)

An Intrinsically Universal Family of Causal Graph Dynamics ⋮ On Goles' universal machines: a computational point of view

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A universal cellular automaton in quasi-linear time and its S-m-n form
• On the computational power of totalistic cellular automata
• HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
• Intrinsic universality of a 1-dimensional reversible Cellular Automaton
• Efficient unidimensional universal cellular automaton
• Simple Computation-Universal Cellular Spaces
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Cellular automata universality revisited