Felipe S. Abrahão

31 papers Journal 30Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The future of fundamental science led by generative closed-loop artificial intelligence. Frontiers Artif. Intell. 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, Jonathan E. Rowe, James A. Evans, Hiroaki Kitano, Ross D. King
2025	J	`jnl`	Binarized Neural Networks Converge Toward Algorithmic Simplicity: Empirical Support for the Learning-as-Compression Hypothesis. CoRR Eduardo Yuji Sakabe, Felipe S. Abrahão, Alexandre da Silva Simões, Esther Colombini, Paula Dornhofer Paro Costa, Ricardo R. Gudwin, Hector Zenil
2025	J	`jnl`	Minimal algorithmic information loss methods for dimension reduction, feature selection and network sparsification. Inf. Sci. Hector Zenil, Narsis A. Kiani, Alyssa M. Adams, Felipe S. Abrahão, Antonio Rueda-Toicen, Allan A. Zea, Luan Ozelim, Jesper Tegnér
2025	J	`jnl`	Neurodivergent Influenceability as a Contingent Solution to the AI Alignment Problem. CoRR Alberto Hernández-Espinosa, Felipe S. Abrahão, Olaf Witkowski, Hector Zenil
2025	J	`jnl`	SuperARC: A Test for General and Super Intelligence Based on First Principles of Recursion Theory and Algorithmic Probability. CoRR Alberto Hernández-Espinosa, Luan Ozelim, Felipe S. Abrahão, Hector Zenil
2024	J	`jnl`	Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms. CoRR Luan Ozelim, Abicumaran Uthamacumaran, Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil
2024	J	`jnl`	Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution. CoRR Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil
2024	J	`jnl`	Decoding Geometric Properties in Non-Random Data from First Information-Theoretic Principles. CoRR Hector Zenil, Felipe S. Abrahão
2024	J	`jnl`	On Sequential Structures in Incompressible Multidimensional Networks. Parallel Process. Lett. Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
2023	J	`jnl`	Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of Models. CoRR Hector Zenil, Alyssa M. Adams, Felipe S. Abrahão
2023	J	`jnl`	The Future of Fundamental Science Led by Generative Closed-Loop Artificial Intelligence. CoRR 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, Jonathan E. Rowe, James A. Evans, Hiroaki Kitano, Joshua B. Tenenbaum, Ross D. King
2023	J	`jnl`	The simplicity bubble effect as a zemblanitous phenomenon in learning systems. CoRR Felipe S. Abrahão, Ricardo P. Cavassane, Michael Winter, Itala M. Loffredo D'Ottaviano
2021	J	`jnl`	Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks. Entropy Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
2021	J	`jnl`	Algorithmic Probability of Large Datasets and the Simplicity Bubble Problem in Machine Learning. CoRR Felipe S. Abrahão, Hector Zenil, Fábio Porto, Klaus Wehmuth
2021	J	`jnl`	Emergence and algorithmic information dynamics of systems and observers. CoRR Felipe S. Abrahão, Hector Zenil
2020	J	`jnl`	Algorithmic Information Dynamics. Scholarpedia Hector Zenil, Narsis Aftab Kiani, Felipe S. Abrahão, Jesper Tegnér
2020	—	`conf`	An Algorithmic Information Distortion in Multidimensional Networks. COMPLEX NETWORKS (2) Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
2020	J	`jnl`	An Algorithmic Information Distortion in Multidimensional Networks. CoRR Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani
2020	J	`jnl`	Emergence of complex data from simple local rules in a network game. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2020	J	`jnl`	On the existence of hidden machines in computational time hierarchies. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2019	J	`jnl`	Algorithmic networks: Central time to trigger expected emergent open-endedness. Theor. Comput. Sci. Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2019	J	`jnl`	Learning the undecidable from networked systems. CoRR Felipe S. Abrahão, Itala M. Loffredo D'Ottaviano, Klaus Wehmuth, Francisco Antonio Doria, Artur Ziviani
2019	J	`jnl`	Transtemporal edges and crosslayer edges in incompressible high-order networks. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2018	J	`jnl`	An algorithmically random family of MultiAspect Graphs and its topological properties. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2018	J	`jnl`	Emergent Open-Endedness from Contagion of the Fittest. Complex Syst. Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2018	J	`jnl`	Emergent Open-Endedness from Contagion of the Fittest. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2018	J	`jnl`	Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2018	J	`jnl`	On incompressible high order networks. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2017	J	`jnl`	Algorithmic Networks: central time to trigger expected emergent open-endedness. CoRR Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
2016	J	`jnl`	Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines. CoRR Felipe S. Abrahão
2016	J	`jnl`	The "paradox" of computability and a recursive relative version of the Busy Beaver function. CoRR Felipe S. Abrahão