Reaction-diffusion automata: Three states implies universality

zbMATH Open0870.68103MaRDI QIDQ679434FDOQ679434

Authors: Eric Goles, Martin Matamala 

Publication date: 22 April 1997

Published in: Theory of Computing Systems (Search for Journal in Brave)

Recommendations

• Machines, Computations, and Universality
• scientific article; zbMATH DE number 1886334
• Glider-based computing in reaction-diffusion hexagonal cellular automata
• On Goles' universal machines: a computational point of view
• scientific article; zbMATH DE number 4195207

zbMATH Keywords

reaction-diffusion automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• On Goles' universal machines: a computational point of view
• Intrinsic universality in automata networks. II: Glueing and gadgets
• Intrinsic universality in automata networks. III: On symmetry versus asynchrony
• Eric Goles
• Machines, Computations, and Universality

This page was built for publication: Reaction-diffusion automata: Three states implies universality

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