Gurevich and Shelah's work on feasibility demonstrates that polynomial-time classification fails to track actual computational resource bounds in finite domains.
?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.