It is fun to implement stuff in Cellular Automata, but since it is proven that CA are computationally equivalent to Turing Machine, what is the value of this work? The original post sounds as if it is sort of technological/scientific breakthrough.
Dr. Dymov from Lomonosov Moscow State University used very little CA (fewer states and smaller local neighbourhood for a cell -- like 3 neighbours only instead of 9 in Life as long as I recall) to model arbitrary boolean circuits. That looked fun.
Would be more challenging if the folks tried to use a CA simpler than Life for their TM modelling.
Slashdot Mirror
It is fun to implement stuff in Cellular Automata, but since it is proven that CA are computationally equivalent to Turing Machine, what is the value of this work? The original post sounds as if it is sort of technological/scientific breakthrough. Dr. Dymov from Lomonosov Moscow State University used very little CA (fewer states and smaller local neighbourhood for a cell -- like 3 neighbours only instead of 9 in Life as long as I recall) to model arbitrary boolean circuits. That looked fun. Would be more challenging if the folks tried to use a CA simpler than Life for their TM modelling.