Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
Felipe S. Abrah\~ao, Santiago Hern\'andez-Orozco, Narsis A. Kiani,, Jesper Tegn\'er, Hector Zenil

TL;DR
This paper proves that Assembly Theory is equivalent to Shannon Entropy and LZ compression algorithms, showing it does not provide new insights into causality or evolution beyond classical information theory.
Contribution
It establishes the formal equivalence between Assembly Theory and traditional compression schemes, clarifying its limitations in explaining causality and evolutionary processes.
Findings
Assembly index is equivalent to minimal context-free grammar size.
Assembly Theory aligns with Shannon Entropy and LZ compression bounds.
AT does not outperform classical measures in explaining biological or physical biases.
Abstract
We prove the full equivalence between Assembly Theory (AT) and Shannon Entropy via a method based upon the principles of statistical compression renamed `assembly index' that belongs to the LZ family of popular compression algorithms (ZIP, GZIP, JPEG). Such popular algorithms have been shown to empirically reproduce the results of AT, results that have also been reported before in successful applications to separating organic from non-organic molecules and in the context of the study of selection and evolution. We show that the assembly index value is equivalent to the size of a minimal context-free grammar. The statistical compressibility of such a method is bounded by Shannon Entropy and other equivalent traditional LZ compression schemes, such as LZ77, LZ78, or LZW. In addition, we demonstrate that AT, and the algorithms supporting its pathway complexity, assembly index, and assembly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Evolutionary Algorithms and Applications
