| Full text | |
| Author(s): |
Uthamacumaran, Abicumaran
;
Abrahao, Felipe S.
;
Kiani, Narsis A.
;
Zenil, Hector
Total Authors: 4
|
| Document type: | Journal article |
| Source: | NPJ SYSTEMS BIOLOGY AND APPLICATIONS; v. 10, n. 1, p. 5-pg., 2024-08-07. |
| Abstract | |
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 cases (synthetic or natural) AT performs similarly to other simple coding schemes and underperforms compared to system-related indexes based upon algorithmic probability that take into account statistical repetitions but also the likelihood of other computable patterns. Our results imply that the assembly index does not offer substantial improvements over existing methods, including traditional statistical ones, and imply that the separation between living and non-living compounds following these methods has been reported before. (AU) | |
| FAPESP's process: | 23/05593-1 - Algorithmic information dynamics of formal theories |
| Grantee: | Felipe Sobreira Abrahão |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |
| FAPESP's process: | 21/14501-8 - Algorithmic-informational systemics: toward a formal theory from mutually self-organizing partial structures |
| Grantee: | Felipe Sobreira Abrahão |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |