Polynomial time computability presupposes a fixed machine model, yet Church-Turing thesis variants leave the notion of 'feasible' computation model-relative.
?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.
Sign in or register to share your perspective on this statement.