If hypercomputation models (Malament-Hogarth spacetimes, accelerating Turing machines) are physically realizable, non-determinism may access super-recursive classes unavailable to standard DTMs.

?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.

Accelerating Turing machines(as used in theoretical computer science): A hypothetical modified computer that gets faster and faster at each step, potentially completing infinite work in finite time.
DTM (Deterministic Turing Machine)(as used in computability theory): A theoretical computer that follows one specific step-by-step path with no choices or branching, like a person methodically trying one maze route at a time.
Malament-Hogarth spacetimes(as used in physics and computation theory): A specific type of curved spacetime (allowed by Einstein's relativity) where the geometry of space and time could theoretically allow a computer to perform infinite calculations in finite time.
Non-determinism(as used in computer science and philosophy of causation): A system where the same starting conditions can lead to multiple different outcomes, rather than always producing one fixed result.

Based on where you are in your exploration