If we allow polynomial variations in running time, Cobham-Edmonds thesis states that "the time complexities in any two reasonable and general models of computation are polynomially related" (Goldreich 2008, Chapter 1.
What thesis specifies that a polynomial relationship exists within time complexities in a computational model? 
Cobham-Edmonds thesis