Timeline for Computing Reversible CA with CellularAutomaton

10 events

when toggle format	what		by	license	comment
May 23, 2016 at 12:59	history	edited	J. M.'s missing motivation♦	CC BY-SA 3.0	deleted 29 characters in body
Jan 15, 2016 at 18:09	answer	added	arkajad		timeline score: 5
Jun 3, 2015 at 15:16	history	edited	andandandand	CC BY-SA 3.0	added 59 characters in body
Jun 3, 2015 at 15:14	comment	added	andandandand		The question is how was the transition function for 150R specified here: "{Mod[Total[Flatten[#]], 2] &, {}, {{-1, 0}, {0, -1}, {0, 0}, {0, 1}}, 2}" Other reversible CA have the same bit-flip behavior when t-1 is 1.
Jun 2, 2015 at 18:08	comment	added	C. E.♦		Another question then: why can't you solve it? You have an example of how to do what you want to do. What specifically is it that you are having trouble with? Are the rules for other cellular automata more complicated?
Jun 2, 2015 at 17:05	history	edited	andandandand	CC BY-SA 3.0	added 7 characters in body
Jun 2, 2015 at 16:39	history	edited	andandandand	CC BY-SA 3.0	added 378 characters in body
Jun 2, 2015 at 13:56	comment	added	andandandand		Oh, the question is how "150" was specified here. The rule is the same as ECA rule 150, flipping the value generated by 150 in t+1 if the cell was '1' in t-1. I'll include this in an image.
Jun 2, 2015 at 5:15	comment	added	C. E.♦		What is the rule for said cellular automata? It is also not clear to me how it will help you if we implement cellular automata x, it won't be more instructive than the example you already have.
Jun 2, 2015 at 3:08	history	asked	andandandand	CC BY-SA 3.0