No, it&#x27;s not true. Even if L1 accesses were only 1 cycle, they would be slower. The CPU will try to execute instructions out-of-order and needs to detect dependencies and possible conflicts between instructions. This is easy with registers, if the registers are the same (have the same name), there may be conflicts or dependencies. This can be tested right after decoding the instruction. With memory it&#x27;s much more complex, because the memory addresses have to be calculated before any comparisons can be made. Therefore it&#x27;s much harder to reorder memory instructions. There are some exceptions, like push&#x2F;pop pairs, but in general memory accesses will be significantly slower.