The ability to simulate non-deterministic Turing machines efficiently is a feature, not a disqualification, if one's criterion for reasonableness is computational power relative to physical resources.

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

Computational power(as used in computer science and philosophy of computation): A measure of what a computer or mathematical system can actually do—how much it can calculate, process, or solve.
Criterion for reasonableness(as used in philosophy of artificial intelligence): The standard or test we use to decide whether something (like a mind or computer) counts as intelligent or capable of thinking.
Efficiently(as used in computational complexity theory): In this context, meaning a computer can solve a problem quickly and without wasting resources, rather than taking an extremely long time.
Non-deterministic Turing machine(The key structural difference from deterministic machines that enables branching computation): A variant of the Turing machine in which the transition function δ is replaced by a transition relation Δ ⊆ (Q × Σ) × (Q × α), allowing a given state-symbol pair to be associated with multiple possible successor state-action pairs

Based on where you are in your exploration