Does anyone know the smallest known number of states that a one-way cellular automata needs to be universal?

We know there is an elementary cellular automata (ECA) with 2 states (Rule 110) that is universal, i.e. Turing-complete.  One-way cellular automata (OCA's) are a subcategory of ECA's where the...

24 November 2016 7,264 4 View