Laurent Boyer

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper concerns µ-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial µ-random configuration. More precisely, we investigate the computational complexity of these sets and of related decision problems. Main results: first, µ-limit sets can have a Σ 0 3-hard(More)
  • 1