Comment by IsTom

What were the reasons to assume it would be true? I mean if you assume that NP < EXPTIME (which seems very likely) then you end up with algorithms that run in exponential time, but can't simulate turing machines with polynomial overhead. Obviously you can't simulate TMs with just anything, but most of the time... computation finds a way?