Actually, according to the extended Church-Turing thesis, all Turing complete systems can emulate each other with at most polynomial overhead, so no exponential

Actually, according to the extended Church-Turing thesis, all Turing complete systems can emulate each other with at most polynomial overhead, so no exponential blow-ups. The only possible exception we know of is quantum computers.