# Return to Question

 Tweeted twitter.com/StackCompSci/status/669662201712680960 occurred Nov 25 '15 at 23:41 4 edited tags edited Oct 16 '15 at 15:34 Raphael♦ 58.9k2525 gold badges144144 silver badges327327 bronze badges I was looking over stephen wolfram's work mainly about Elementary Cellular Automata, i see that for all rules with N steps {i.e 200 steps} they show the same pattern {i,e rule 90 running on 20 steps and 100 steps are the same, like Here}. Unlike rule 110 which shows different behavior when N = 20, 100 or 200, i know that it is universal but does that mean if a cellular automaton structure does not halt {continue to show different pattern when changing N steps} does that means it is always universal ? === edited with examples === I was looking over stephen wolfram's work mainly about Elementary Cellular Automata, i see that for all rules with N steps {i.e 200 steps} they show the same pattern {i,e rule 90 running on 20 steps and 100 steps are the same, like Here}. Unlike rule 110 which shows different behavior when N = 20, 100 or 200, i know that it is universal but does that mean if a cellular automaton structure does not halt {continue to show different pattern when changing N steps} does that means it is always universal ? === edited with examples === I was looking over stephen wolfram's work mainly about Elementary Cellular Automata, i see that for all rules with N steps {i.e 200 steps} they show the same pattern {i,e rule 90 running on 20 steps and 100 steps are the same, like Here}. Unlike rule 110 which shows different behavior when N = 20, 100 or 200, i know that it is universal but does that mean if a cellular automaton structure does not halt {continue to show different pattern when changing N steps} does that means it is always universal ? 3 added 55 characters in body edited Oct 16 '15 at 14:43 Magnda 2433 bronze badges I was looking over stephen wolfram's work mainly about Elementary Cellular Automata and, i see that almostfor all the rules afterwith N steps for all rules {i.e 200 steps}, they show the same structurepattern {i,e rule 90 running on 20 steps and 100 steps are the same, like Here} unlike. Unlike rule 110 which shows different behavior when N = 20020, more100 or less ...200, i know that it is universal but does that mean if a cellular automaton structure does not halt {continue running to show different behaviorpattern when changing N steps} does that means it is always universal ? === edited with examples === I was looking over stephen wolfram's work mainly about Elementary Cellular Automata and i see that almost all the rules after N steps for all rules {i.e 200 steps}, they show the same structure {i,e rule 90 running on 20 steps and 100 steps, Here} unlike rule 110 which shows different behavior when N = 200, more or less ... i know that it is universal but does that mean if a cellular automaton does not halt {continue running to show different behavior} does that means it is always universal ? I was looking over stephen wolfram's work mainly about Elementary Cellular Automata, i see that for all rules with N steps {i.e 200 steps} they show the same pattern {i,e rule 90 running on 20 steps and 100 steps are the same, like Here}. Unlike rule 110 which shows different behavior when N = 20, 100 or 200, i know that it is universal but does that mean if a cellular automaton structure does not halt {continue to show different pattern when changing N steps} does that means it is always universal ? === edited with examples === 2 example edit edited Oct 16 '15 at 14:26 Magnda 2433 bronze badges I was looking over stephen wolfram's work mainly about Elementary Cellular Automata and i see that almost all the rules after N steps for all rules {i.e 200 steps}, they show the same structure as if N ={i,e rule 90 running on 20 steps and 100 for examplesteps, Here} unlike rule 110 which shows different behavior when N = 200 or, more or less ... i know that it is universal but does that mean if a cellular automaton does not halt {continue running to show different behavior} does that means it is always universal ? I was looking over stephen wolfram's work mainly about Elementary Cellular Automata and i see that almost all the rules after N steps for all rules {i.e 200 steps}, they show the same structure as if N = 100 for example, unlike rule 110 which shows different behavior when N = 200 or more ... i know that it is universal but does that mean if a cellular automaton does not halt {continue running to show different behavior} does that means it is always universal ? I was looking over stephen wolfram's work mainly about Elementary Cellular Automata and i see that almost all the rules after N steps for all rules {i.e 200 steps}, they show the same structure {i,e rule 90 running on 20 steps and 100 steps, Here} unlike rule 110 which shows different behavior when N = 200, more or less ... i know that it is universal but does that mean if a cellular automaton does not halt {continue running to show different behavior} does that means it is always universal ? 1 asked Oct 16 '15 at 14:20 Magnda 2433 bronze badges