There is something Wolfram would call computational irreducibility (related to the Halting Problem), which means even though the simulation is just a determinis

There is something Wolfram would call computational irreducibility (related to the Halting Problem), which means even though the simulation is just a deterministic mathematical function, to know what happens in it you must run the code, and that may require lot of memory and compute along the way even if the universe ends in an heat death. In fact universe is probably stored by a seed (42), along something like 10 lines of definition, and 100 line of code would be enough to implement it in a naive version (Physicists sell tee-shirts with some pseudo version of it). Morpheus would say : "There's a difference between knowing the path and walking the path..."