Eh, is this some kind of trick question? Or a trick question on yourself? Don’t mean to be dismissive though also don’t really care if I am, but one of the basic tenets of computer science and the deeper math “below” that is that all non-trivial outputs of programs are not determinable without running the program in question. That’s Rice’s Theorem and it’s a generalization of the halting problem first formalized by Alan Turing.

There is not a single word for it, I guess. “Undecidability,” perhaps. But Rice’s Theorem and its various proofs are what’s being sought here. There is no possibility of omniscience for us in this realm. You might write the sim, but you still don’t know what it’ll do without setting it in motion and taking a peek. That’s all that is possible (even in principle).