Poupet, Victor; Laboratoire de l'informatique du parallélisme
(LIP, 2006-02)
(eng) In this article we will focus on a famous open question about algorithmic
complexity classes on one dimensional cellular automata, and we will
show that if all problems recognizable in space n (where n is the length ...