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