Fig. 3
From: Assembly theory and its relationship with computational complexity
The most compressible string of a single letter as represented in n steps of Lempel–Ziv–Welch (LZW) compared with n assembly steps, demonstrating that the scaling of the two algorithms is not equivalent and by extension there can be no formal equivalence between the two.
