If computational tractability varies across machine models, then P≠NP on classical machines may not reflect fundamental problem difficulty universally.
?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.