1 citations · 1 across the 2 of their papers we have counts for
5 papers
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…
Nomic realism, simplicity, and the simplicity bubble effect
Felipe S. Abrahão, Raoni Arroyo
We offer an argument against simplicity as a sole intrinsic criterion for nomic realism. The argument is based on the simplicity bubble effect. Underdetermination in quantum founda…
The Future of Fundamental Science Led by Generative Closed-Loop Artificial Intelligence
Hector Zenil, Jesper Tegnér, Felipe S. Abrahão +17
Recent advances in machine learning and AI, including Generative AI and LLMs, are disrupting technological innovation, product development, and society as a whole. AI's contributio…
The "paradox" of computability and a recursive relative version of the Busy Beaver function
Felipe S. Abrahão
In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turi…
Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines
Felipe S. Abrahão
We show in this article that uncomputability is also a relative property of subrecursive classes built on a recursive relative incompressible function, which acts as a higher-order…