Greetings everyone,

I was wondering whether there are any interesting aspects of cellular automata as computational models in the strict(er) sense of the term:

  • Formulate the problem into an initial state of the automaton
  • Run n generations
  • Transform the resulting state back into a solution that makes sense in terms of the original formulation
  • For example: a 2D cellular automaton sorting an array of numbers or so, or something more complicated. Note: I am not referring for example to a Turing Machine designed in the Game of Life where the gliders can be seen as bits/wires etc, but rather a rule that has been designed for such purposes.

    Are there any interesting works/papers you could suggest?

    More Nikolaos Kyparissas's questions See All
    Similar questions and discussions