Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
Fig 2
A timeline of results in complexity science relevant to the claims and results of AT, which renames several concepts, e.g. dictionary trees as ‘assembly (sub)spaces’; relies heavily on algorithmic probability in its reduction of combinatorial space arguments, without attribution; and, as demonstrated, the assembly index is an LZ compression scheme (proofs provided in the S1 Appendix).