Our present best guess is that cellular automatons would be an explosively difficult way to simulate the universe because BQP (the class of problems that can be

Our present best guess is that cellular automatons would be an explosively difficult way to simulate the universe because BQP (the class of problems that can be related to simulating a quantum system for polynomial time) is probably not contained in P (the class of problems Turing machines can solve in polynomial time).