It is not the case that Polynomial time computability presupposes a fixed machine model, yet Church-Turing thesis variants leave the notion of 'feasible' computation model-relative.
?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.