It is not the case that If 'feasible computation' is not co-extensional with polynomial time across all physically realizable models, the closure property of NP under polynomial reductions loses its unconditional force.
?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.