Freezing, bounded-change and convergent cellular automata

HIGHLIGHTS

• who: DMTCS vol. and collaborators from the UnivOrléans, INSA Centre Val de Loire, LIFO EA, Orléans, France have published the Article: Freezing, Bounded-Change and Convergent Cellular Automata, in the Journal: (JOURNAL)
• what: The authors show that even the most constrained setting (freezing 1D CA) can achieve universality in the sense of_[10] (Theorem 5). Concerning dimension sensitiveness, the authors show that various aspects are affected: the capacity to efficiently compute or the capacity to produce uncomputable limit points from computable initial configuration for bounded-change CA, and the decidability of nilpotency for . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.