The paper[1] I linked to in my other post shows that you cannot perform such a simulation because it is undecidable. (Specifically, BB(N >= 1919) is provably undecidable in ZFC).
Please show how that paper describes a Turing machine 'programmed with PE' can't simulate a Turing machine 'programmed with ZFC'?
Perhaps we are arguing over what 'programmed with PE' or 'programmed with ZFC' means? The parent post seemed to claim that it was possible to construct a physical computer with the axioms of ZFC built-in so to speak. As opposed to one with PE built-in. Which obviously calls into question the parent post understanding of what exactly idealized Turing machines are.