What I mean is that in the GoL or another Turing-complete cellular automaton one can specify a universe by a few simple rules and initial conditions. I wonder if it is possible to construct a simple universe with a rudimentary AIXItl machine in it. As a first step, I would like to know how to define an AIXItl subset of a cellular automaton.
Writing any non-trivial program in such simple cellular automata is often too difficult to be pratically feasible. Think of designing a race car by specifying the position of each individual atom.
If you’ve got a modular way of implementing logical operations in a cellular automaton, which wedo in Life, you could automate the tedious parts by using a VHDL-like system. The resulting grid would be impractically huge, but there’s probably no good way around that.
What I mean is that in the GoL or another Turing-complete cellular automaton one can specify a universe by a few simple rules and initial conditions. I wonder if it is possible to construct a simple universe with a rudimentary AIXItl machine in it. As a first step, I would like to know how to define an AIXItl subset of a cellular automaton.
Writing any non-trivial program in such simple cellular automata is often too difficult to be pratically feasible. Think of designing a race car by specifying the position of each individual atom.
If you’ve got a modular way of implementing logical operations in a cellular automaton, which we do in Life, you could automate the tedious parts by using a VHDL-like system. The resulting grid would be impractically huge, but there’s probably no good way around that.
Sure