Machines, Computations, and Universality

DOI10.1007/B106980MaRDI QIDQ5710892zbMATH OpenOpenAlexFDO

Authors K. Sutner

Publication date 8 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106980

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 3896307
• scientific article; zbMATH DE number 17562
• Computational classification of cellular automata
• Cellular automata and intermediate degrees.
• Cellular automata universality revisited

Cited in

(16)

• Computational equivalence and classical recursion theory
• Universal groups of cellular automata
• Computation and universality: Class IV versus Class III cellular automata
• Machines, Computations, and Universality
• scientific article; zbMATH DE number 5252388 (Why is no real title available?)
• scientific article; zbMATH DE number 7724182 (Why is no real title available?)
• A full computation-relevant topological dynamics classification of elementary cellular automata
• Cellular automata and intermediate degrees.
• Invariance and Universality of Complexity
• Behavioral complexity indicators for process algebra: The NKS approach
• Computational processes and incompleteness
• On the dynamics and recursive properties of multidimensional symbolic systems
• scientific article; zbMATH DE number 2063251 (Why is no real title available?)
• Computational universality of fungal sandpile automata
• Cellular automata universality revisited
• Simulation limitations of affine cellular automata

This page was built for publication: Machines, Computations, and Universality

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