Constructibility assumptions smuggle in a non-trivial ontological commitment — that resources are measurable by the same machine — which fails for non-uniform or oracle-augmented complexity classes.

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

Complexity classes(as used in computer science and philosophy of computation): In computer science, groups of problems sorted by how hard they are to solve—roughly, how much computing power and time they require.
Constructibility(as used in mathematics and computer science): The quality of being able to build or compute something using a defined set of tools or rules.
Non-uniform complexity(contrasted with uniform complexity where the same resources apply to all problems): A type of computational problem where the rules or resources available can vary depending on the specific input size, rather than following one uniform rule for all inputs.
Oracle-augmented complexity(a theoretical tool used to understand the limits of computation): A way of measuring how hard a computational problem is when you have access to a magical helper (called an 'oracle') that can instantly answer certain difficult questions.

Based on where you are in your exploration