Hartmanis and Stearns established that complexity classes defined across different machine models are robustly equivalent up to polynomial factors, preserving the tractability/intractability distinction.

?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.

Complexity classes(as used in computer science and philosophy of computation): In computer science, groups of problems sorted by how hard they are to solve—roughly, how much computing power and time they require.
Hartmanis and Stearns(as founders of computational complexity theory): Two computer scientists who developed an important framework for understanding how much computational effort (time or memory) different types of problems require to solve.
Machine models(as used in theoretical computer science): Different theoretical designs or frameworks for how computers process information, like imagining a computer that works in one way versus another way.
Polynomial factors(as used in computational complexity): A measure of how much slower or faster one machine is compared to another—if one machine takes twice as long or ten times as long, that's a polynomial difference; exponentially larger differences would be much more dramatic.

Based on where you are in your exploration