Efficient unidimensional universal cellular automaton

DOI10.1007/3-540-55808-X_36MaRDI QIDQ5096850zbMATH OpenOpenAlexFDO

Authors Bruno Martin

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55808-x_36

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 1738667
• Efficient pushdown cellular automata: universality, time and space hierarchies
• Intrinsically universal cellular automata
• scientific article; zbMATH DE number 4195207
• Universality in elementary cellular automata
• Achieving universal computations on one-dimensional cellular automata
• A particular universal cellular automaton
• Cellular automata universality revisited
• About strongly universal cellular automata
• scientific article; zbMATH DE number 2063252

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• scientific article; zbMATH DE number 4195207 (Why is no real title available?)
• scientific article; zbMATH DE number 3896307 (Why is no real title available?)
• scientific article; zbMATH DE number 4070331 (Why is no real title available?)
• scientific article; zbMATH DE number 43004 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• On real-time cellular automata and trellis automata
• Real-time language recognition by one-dimensional cellular automata
• Simple Computation-Universal Cellular Spaces

Cited in

(22)

• A universal cellular automaton in quasi-linear time and its S-m-n form
• Computations on one-dimensional cellular automata
• The mirage of universality in cellular automata
• Grids and universal computations on one-dimensional cellular automata
• Towards intrinsically universal asynchronous CA
• scientific article; zbMATH DE number 4195207 (Why is no real title available?)
• scientific article; zbMATH DE number 6502831 (Why is no real title available?)
• Efficient pushdown cellular automata: universality, time and space hierarchies
• A simple n-dimensional intrinsically universal quantum cellular automaton
• On factor universality in symbolic spaces
• scientific article; zbMATH DE number 4070331 (Why is no real title available?)
• scientific article; zbMATH DE number 1962850 (Why is no real title available?)
• scientific article; zbMATH DE number 1985715 (Why is no real title available?)
• scientific article; zbMATH DE number 1738667 (Why is no real title available?)
• scientific article; zbMATH DE number 2086632 (Why is no real title available?)
• Achieving universal computations on one-dimensional cellular automata
• Intrinsic simulations between stochastic cellular automata
• Cellular automata are generic
• Cellular automata universality revisited
• Intrinsically universal cellular automata
• Bulking I: An abstract theory of bulking
• Communication complexity and intrinsic universality in cellular automata

This page was built for publication: Efficient unidimensional universal cellular automaton

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