Buscar
Mostrando ítems 1-1 de 1
Computation and Universality: Class IV versus Class III Cellular Automata
(2013)
This paper examines the claim that cellular automata (CA) belonging toClass III (in Wolfram?s classification) are capable of (Turing universal)computation.We explore some chaotic CA (believed to belong to ClassIII) reported ...