Many productive theorems (P vs NP, halting problem) use idealized models yet restrict computational claims appropriately without invoking the unrealizability objection.
?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.