It is not the case that 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.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.