Computation and Universality: Class IV versus Class III Cellular Automata

Abstract

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 over the course of the CA history, that may be candidatesfor universal computation, hence spurring the discussion on Turing universality on both Wolfram?s classes III and IV.