18 citations · 21 across the 9 of their papers we have counts for
5 papers · 1 filter
Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method
Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco +2
The Block Decomposition Method (BDM) was introduced as an alternative to popular lossless compression methods such as LZW for estimating algorithmic complexity from the principles…
Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
Luan Ozelim, Abicumaran Uthamacumaran, Felipe S. Abrahão +4
Assembly Theory (AT) and its central measure, the assembly index (Ai), represent an invaluable opportunity to address some of the most persistent and widespread conflations and mis…
Non-Random Data Encodes its Geometric and Topological Dimensions
Hector Zenil, Felipe S. Abrahão, Luan C. S. M. Ozelim
Based on the principles of information theory, measure theory, and theoretical computer science, we introduce a signal deconvolution method with a wide range of applications to cod…
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani +2
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 belon…
On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular Biosignatures
Abicumaran Uthamacumaran, Felipe S. Abrahão, Narsis A. Kiani +1
We demonstrate that the assembly pathway method underlying assembly theory (AT) is an encoding scheme widely used by popular statistical compression algorithms. We show that in all…