Complexity steering in cellular automata

DOI10.25088/COMPLEXSYSTEMS.27.2.159MaRDI QIDQ5126845zbMATH OpenFDO

Authors Bar Y. Peled, Avishy Carmi

Publication date 20 October 2020

Published in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.25088/COMPLEXSYSTEMS.27.2.159

zbMATH Keywords

cellular automataKolmogorov complexitynegentropyself-replicationuniversal computation

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Cellular automata (computational aspects) (68Q80) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Asymptotic Cellular Complexity
• scientific article; zbMATH DE number 3896307
• Self-reproduction in small cellular automata
• scientific article; zbMATH DE number 3898244
• Cellular automata universality revisited

Cited in

(2)

• Random expansion method for the generation of complex cellular automata
• Logical universality from a minimal two-dimensional glider gun

This page was built for publication: Complexity steering in cellular automata

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