Felipe S. Abrahão

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 24

Top Topics

Computationally Tractable

Geometric Properties

Top Venues

COMPLEX NETWORKS (2)

Publications

Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution. CoRR (2024)
Hector Zenil, Felipe S. Abrahão
Decoding Geometric Properties in Non-Random Data from First Information-Theoretic Principles. CoRR (2024)
Felipe S. Abrahão, Ricardo P. Cavassane, Michael Winter, Itala M. Loffredo D'Ottaviano
The simplicity bubble effect as a zemblanitous phenomenon in learning systems. CoRR (2023)
Hector Zenil, Jesper Tegnér, Felipe S. Abrahão, Alexander Lavin, Vipin Kumar, Jeremy G. Frey, Adrian Weller, Larisa N. Soldatova, Alan R. Bundy, Nicholas R. Jennings, Koichi Takahashi, Lawrence Hunter, Saso Dzeroski, Andrew Briggs, Frederick D. Gregory, Carla P. Gomes, Christopher K. I. Williams, Jon Rowe, James A. Evans, Hiroaki Kitano, Joshua B. Tenenbaum, Ross D. King
The Future of Fundamental Science Led by Generative Closed-Loop Artificial Intelligence. CoRR (2023)
Hector Zenil, Alyssa M. Adams, Felipe S. Abrahão
Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of Models. CoRR (2023)
Felipe S. Abrahão, Hector Zenil, Fábio Porto, Klaus Wehmuth
Algorithmic Probability of Large Datasets and the Simplicity Bubble Problem in Machine Learning. CoRR (2021)
Felipe S. Abrahão, Hector Zenil
Emergence and algorithmic information dynamics of systems and observers. CoRR (2021)
Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks. Entropy 23 (7) (2021)
Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
An Algorithmic Information Distortion in Multidimensional Networks. CoRR (2020)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Emergence of complex data from simple local rules in a network game. CoRR (2020)
Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
An Algorithmic Information Distortion in Multidimensional Networks. COMPLEX NETWORKS (2) (2020)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
On the existence of hidden machines in computational time hierarchies. CoRR (2020)
Hector Zenil, Narsis Aftab Kiani, Felipe S. Abrahão, Jesper Tegnér
Algorithmic Information Dynamics. Scholarpedia 15 (7) (2020)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Transtemporal edges and crosslayer edges in incompressible high-order networks. CoRR (2019)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Algorithmic networks: Central time to trigger expected emergent open-endedness. Theor. Comput. Sci. 785 (2019)
Felipe S. Abrahão, Itala M. Loffredo D'Ottaviano, Klaus Wehmuth, Francisco Antonio Doria, Artur Ziviani
Learning the undecidable from networked systems. CoRR (2019)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
On incompressible high order networks. CoRR (2018)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Emergent Open-Endedness from Contagion of the Fittest. Complex Syst. 27 (4) (2018)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence. CoRR (2018)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
An algorithmically random family of MultiAspect Graphs and its topological properties. CoRR (2018)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Emergent Open-Endedness from Contagion of the Fittest. CoRR (2018)
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Algorithmic Networks: central time to trigger expected emergent open-endedness. CoRR (2017)
Felipe S. Abrahão
The "paradox" of computability and a recursive relative version of the Busy Beaver function. CoRR (2016)
Felipe S. Abrahão
Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines. CoRR (2016)