Intrinsic universality in automata networks. I: Families and simulations

DOI10.1016/J.TCS.2024.114511MaRDI QIDQ6128704zbMATH OpenFDO

Authors Martín Ríos-Wilson, Guillaume Theyssier

Publication date 16 April 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114511

zbMATH Keywords

automata networksintrinsic universalityprediction problemreachability problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Intrinsic universality in automata networks. II: Glueing and gadgets
• On simulation in automata networks
• Intrinsic universality in automata networks. III: On symmetry versus asynchrony
• Communication complexity and intrinsic universality in cellular automata
• Expansive automata networks

Cited in

(3)

• On simulation in automata networks
• Intrinsic universality in automata networks. II: Glueing and gadgets
• Intrinsic universality in automata networks. III: On symmetry versus asynchrony

This page was built for publication: Intrinsic universality in automata networks. I: Families and simulations

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