Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol

DOI10.1007/978-3-540-92182-0_53MaRDI QIDQ3596753zbMATH OpenOpenAlexFDO

Authors Cedric Little, Ivan Rapaport, Eric Goles

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_53

Mathematics Subject Classification ID

Network protocols (68M12) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 6502824
• Communication complexity and intrinsic universality in cellular automata
• Cellular automata and communication complexity
• Communications in cellular automata
• Communication complexity meets cellular automata: necessary conditions for intrinsic universality
• Cellular Automata with Sparse Communication
• Cellular automata with sparse communication
• On two-way communication in cellular automata with a fixed number of cells
• Traced communication complexity of cellular automata
• Unraveling simplicity in elementary cellular automata

Cited in

(8)

• Eric Goles
• Unraveling simplicity in elementary cellular automata
• scientific article; zbMATH DE number 6502824 (Why is no real title available?)
• Communications in cellular automata
• Traced communication complexity of cellular automata
• Communication complexity in number-conserving and monotone cellular automata
• Communication complexity meets cellular automata: necessary conditions for intrinsic universality
• Communication complexity and intrinsic universality in cellular automata

This page was built for publication: Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol

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