Phase space invertible asynchronous cellular automata

MaRDI QIDQ4986319zbMATH OpenFDO

Authors Simon Wacker, Thomas Worsch

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2765, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AUTOJAC2012.19

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 6257036
• Reversibility in asynchronous cellular automata
• Towards intrinsically universal asynchronous CA
• Reversibility of elementary cellular automata under fully asynchronous update
• HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA

Cited in

(5)

• HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
• Reversibility in asynchronous cellular automata
• scientific article; zbMATH DE number 7180000 (Why is no real title available?)
• Reversibility of elementary cellular automata under fully asynchronous update
• scientific article; zbMATH DE number 6257036 (Why is no real title available?)

This page was built for publication: Phase space invertible asynchronous cellular automata

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