default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelipe S. Abrahão
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i20]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 abs/2403.06629 (2024)- [i19]Hector Zenil, Felipe S. Abrahão:
Decoding Geometric Properties in Non-Random Data from First Information-Theoretic Principles. CoRR abs/2405.07803 (2024) - [i18]Luan Ozelim, Abicumaran Uthamacumaran, Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani, Jesper Tegnér, Hector Zenil:
Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms. CoRR abs/2408.15108 (2024) - 2023
- [i17]Hector Zenil, Alyssa M. Adams, Felipe S. Abrahão:
Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of Models. CoRR abs/2303.16045 (2023) - [i16]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 abs/2304.10681 (2023) - [i15]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 abs/2307.07522 (2023) - 2021
- [j4]Felipe S. Abrahão
, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks. Entropy 23(7): 835 (2021) - [i14]Felipe S. Abrahão, Hector Zenil:
Emergence and algorithmic information dynamics of systems and observers. CoRR abs/2105.14707 (2021) - [i13]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 abs/2112.12275 (2021) - 2020
- [j3]Hector Zenil, Narsis Aftab Kiani, Felipe S. Abrahão, Jesper Tegnér:
Algorithmic Information Dynamics. Scholarpedia 15(7): 53143 (2020) - [c1]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
An Algorithmic Information Distortion in Multidimensional Networks. COMPLEX NETWORKS (2) 2020: 520-531 - [i12]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
On the existence of hidden machines in computational time hierarchies. CoRR abs/2009.01145 (2020) - [i11]Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani:
An Algorithmic Information Distortion in Multidimensional Networks. CoRR abs/2009.05879 (2020) - [i10]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Emergence of complex data from simple local rules in a network game. CoRR abs/2009.12210 (2020)
2010 – 2019
- 2019
- [j2]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Algorithmic networks: Central time to trigger expected emergent open-endedness. Theor. Comput. Sci. 785: 83-116 (2019) - [i9]Felipe S. Abrahão, Itala M. Loffredo D'Ottaviano, Klaus Wehmuth, Francisco Antonio Doria, Artur Ziviani:
Learning the undecidable from networked systems. CoRR abs/1904.07027 (2019) - [i8]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Transtemporal edges and crosslayer edges in incompressible high-order networks. CoRR abs/1905.05276 (2019) - 2018
- [j1]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Emergent Open-Endedness from Contagion of the Fittest. Complex Syst. 27(4) (2018) - [i7]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Emergent Open-Endedness from Contagion of the Fittest. CoRR abs/1806.07254 (2018) - [i6]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
An algorithmically random family of MultiAspect Graphs and its topological properties. CoRR abs/1810.11719 (2018) - [i5]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
On incompressible high order networks. CoRR abs/1812.01170 (2018) - [i4]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence. CoRR abs/1812.05912 (2018) - 2017
- [i3]Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani:
Algorithmic Networks: central time to trigger expected emergent open-endedness. CoRR abs/1708.09149 (2017) - 2016
- [i2]Felipe S. Abrahão:
Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines. CoRR abs/1612.05221 (2016) - [i1]Felipe S. Abrahão:
The "paradox" of computability and a recursive relative version of the Busy Beaver function. CoRR abs/1612.07400 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
