Putnam's argument targets reference-fixing for general terms; 'polynomial-time computable' has clear extensional definition in standard models of arithmetic.
?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.