Cobham-Edmonds thesis disputes that Turing machine resource bounds track an objective notion of feasibility, undermining the claim that hierarchy theorems reveal mind-independent structural truths.

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

Cobham-Edmonds Thesis(Used to assess feasibility of decision problems in complexity theory.): The thesis used to judge whether a computational problem is feasibly decidable by examining whether the time complexity of the most efficient algorithm for the problem grows at most polynomially.
Feasibility(as used in logic and computation): Whether something is actually possible to do in practice, considering real-world limitations like time and resources—not just theoretically possible.
Hierarchy theorems(as used in computational complexity theory): Mathematical proofs showing that complexity classes form a strict ranking—that harder problems genuinely require more time or resources to solve than easier ones.
Mind-independent structural truths(as used in metaphysics and epistemology): Facts about how reality is organized that exist whether or not anyone is thinking about them; truths about the world that aren't just invented by humans.

Based on where you are in your exploration