The simulation argument assumes that nondeterministic computation is a coherent idealization, but Kripke's skeptical paradox about rule-following applies equally to idealized machine transitions.

?Rate how convincing each reason is below to see the overall strength.

No one has weighed in yet. Be the first to share reasons for or against this statement.

Coherent idealization(as a methodological approach in philosophy): A simplified or imaginary version of something that makes logical sense and can be used in thinking, even if it doesn't exist perfectly in real life.
Kripke's skeptical paradox(as a philosophical challenge about meaning and rule-following): A puzzle created by philosopher Saul Kripke showing that it's mysteriously hard to explain how we follow rules consistently—we might just be making it all up without realizing it.
Machine transitions(as a technical concept in computing): The moments when a computer or computing system moves from one state or operation to another as it processes information.
Nondeterministic computation(in computer science): A type of computing where the computer can explore multiple possible paths at once, like being able to guess and check many solutions simultaneously.

Based on where you are in your exploration