With the correct initial state, any Turing complete cellular automata (like CGoL) can model any computable system. We can computationally model prevailing quantum models (albeit incredibly slowly), so an unbounded CGoL field would fit the criteria.