It is not the case that Descriptive complexity results like Fagin's theorem presuppose fixed finite ordered structures, but the P vs NP problem ranges over all computational models regardless of representational assumptions.
?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.