Descriptive complexity of sensitivity of cellular automata

DOI10.1007/978-3-032-01570-9_9MaRDI QIDQ6860454zbMATH OpenFDO

Authors Tom Favereau, Ville Salo

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01570-9_9

zbMATH Keywords

sensitivitycellular automataarithmetical hierarchy

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Cites work

• scientific article; zbMATH DE number 1714670 (Why is no real title available?)
• scientific article; zbMATH DE number 4211534 (Why is no real title available?)
• scientific article; zbMATH DE number 2046045 (Why is no real title available?)
• Languages, equicontinuity and attractors in cellular automata
• Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata
• Statistical mechanics of cellular automata
• Topological dynamics of cellular automata: dimension matters

This page was built for publication: Descriptive complexity of sensitivity of cellular automata

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