Parberry (1986) and others have argued that the Church-Turing Thesis does not entail that polynomial time on a Turing machine tracks feasibility across all physically realizable computation models.

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

Church-Turing thesis(Presented as a thesis about the upper bound of computational power, not a proven fact.): The thesis that no computational system stronger than the class of Turing machines exists.
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.
Parberry (1986)(as used in academic citations): A reference to a published work by researcher Ian Parberry from the year 1986, cited as evidence for a particular argument about computation.
Turing machine(Computability theory): A formal computational model defined to study the notion of computation, containing elementary arithmetic and capable of expressing universality, negation, and self-reference

Based on where you are in your exploration