> You can not do so because Turing machines are universal.
Just because Turing machines are universal making it possible to write a program that asks a question about another type of Turning machine doesn't mean that question is decidable.
Just because Turing machines are universal making it possible to write a program that asks a question about another type of Turning machine doesn't mean that question is decidable.
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.