When a CPU simulates a certain program, as they do all the time, this is inherently slower than if the program would have been baked in into the hardware and computed directly. We know this from practical experience.My question is: Is there some theoretical relationship that shows that a program that is simulated by a universal program, is inherently slower than that program executed by itself?
Is a TM that is simulated by a universal TM theoretically inherently slower than the TM itself?
turing machines;computation models;efficiency;simulation