Computing on rings

DOI10.1142/9789814374309_0014zbMATH Open1256.68125OpenAlexW2502574190MaRDI QIDQ4907924FDOQ4907924

Authors: Genaro J. Martínez, Andrew Adamatzky, Harold V. McIntosh 

Publication date: 26 February 2013

Published in: A Computable Universe (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/70e2b5375cbde7631b326ee60876c5fc359bbd3b

Recommendations

• Cellular automaton supercolliders
• Glider-based computing in reaction-diffusion hexagonal cellular automata
• Logical gates via gliders collisions
• Collision-based implementation of a two-bit adder in excitable cellular automaton
• scientific article; zbMATH DE number 5582873

zbMATH Keywords

particlescellular automataunconventional computingringscollisionscomputabilitybeam routing

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cited In (7)

• On Learning Ring-Sum-Expansions
• Collision-based implementation of a two-bit adder in excitable cellular automaton
• Title not available (Why is that?)
• Cellular automaton supercolliders
• Rings: an efficient JVM library for commutative algebra (invited talk)
• Title not available (Why is that?)
• FILTRONS AND THEIR ASSOCIATED RING COMPUTATIONS

This page was built for publication: Computing on rings

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