It is not the case that Hartmanis and Stearns established that complexity classes defined across different machine models are robustly equivalent up to polynomial factors, preserving the tractability/intractability distinction.
?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.