Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
We formally prove the equivalence between Assembly Theory (AT) and Shannon Entropy via a method based upon the principles of statistical compression that belongs to the LZ family of popular compression algorithms. Such popular lossless compression algorithms behind file formats such as ZIP and PNG h...
Main Authors: | Abrahão, FS, Hernández-Orozco, S, Kiani, NA, Tegnér, J, Zenil, H |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Public Library of Science
2024
|
Similar Items
-
On the salient limitations of the methods of assembly theory and their classification of molecular biosignatures
by: Uthamacumaran, A, et al.
Published: (2024) -
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
by: Dominik Köppl
Published: (2021-01-01) -
How Does a Transformer Learn Compression? An Attention Study on Huffman and LZ4
by: Beomseok Seo, et al.
Published: (2023-01-01) -
Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results
by: Hector Zenil, et al.
Published: (2023-01-01) -
A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression
by: Hao Jiang, et al.
Published: (2020-01-01)