Hector Zenil

Dr. Hector Zenil

Senior Researcher/Assistant Professor and Lab Leader
+3

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 May 2014 in PLOS ONE
Verified
Journal Article
Open access
PDF file
FSFernando Soler-Toscano
Fernando Soler-Toscano
Hector ZenilHector Zenil
Hector Zenil
JDJean-Paul Delahaye
Jean-Paul Delahaye
NGNicolas Gauvrit
Nicolas Gauvrit
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all binary strings of length and for most strings of length by running all Turing machines with 5 states and 2 symbols ( with reduction techniques) using the most standard formalism of Turing machines, used in for example the Busy Beaver problem. We address the question of stability and error estimation, the sensitivity of the continued application of the method for wider coverage and better accuracy, and provide statistical evidence suggesting robustness. As with compression algorithms, this work promises to deliver a range of applications, and to provide insight into the question of complexity calculation of finite (and short) strings. Additional material can be found at the Algorithmic Nature Group website at http://www.algorithmicnature.org. An Online Algorithmic Complexity Calculator implementing this technique and making the data available to the research community is accessible at http://www.complexitycalculator.com.

15 August 2018 in Entropy
Verified
Journal Article
Open access
PDF file
Hector ZenilHector Zenil
Hector Zenil
SHSantiago Hernández-Orozco
Santiago Hernández-Orozco
Narsis KianiNarsis Kiani
Narsis Kiani
FSFernando Soler-Toscano
Fernando Soler-Toscano
ARAntonio Rueda-Toicen
Antonio Rueda-Toicen
JTJesper Tegner
Jesper Tegner
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based on Solomonoff–Levin’s theory of algorithmic probability providing a closer connection to algorithmic complexity than previous attempts based on statistical regularities such as popular lossless compression schemes. The strategy behind BDM is to find small computer programs that produce the components of a larger, decomposed object. The set of short computer programs can then be artfully arranged in sequence so as to produce the original object. We show that the method provides efficient estimations of algorithmic complexity but that it performs like Shannon entropy when it loses accuracy. We estimate errors and study the behaviour of BDM for different boundary conditions, all of which are compared and assessed in detail. The measure may be adapted for use with more multi-dimensional objects than strings, objects such as arrays and tensors. To test the measure we demonstrate the power of CTM on low algorithmic-randomness objects that are assigned maximal entropy (e.g., π ) but whose numerical approximations are closer to the theoretical low algorithmic-randomness expectation. We also test the measure on larger objects including dual, isomorphic and cospectral graphs for which we know that algorithmic randomness is low. We also release implementations of the methods in most major programming languages—Wolfram Language (Mathematica), Matlab, R, Perl, Python, Pascal, C++, and Haskell—and an online algorithmic complexity calculator.

1 September 2019 in iScience
Verified
Journal Article
Open access
Hector ZenilHector Zenil
Hector Zenil
Narsis KianiNarsis Kiani
Narsis Kiani
FMFrancesco Marabita
Francesco Marabita
YDYue Deng
Yue Deng
SESzabolcs Elias
Szabolcs Elias
JTJesper Tegner
Jesper Tegner
We introduce and develop a method that demonstrates that the algorithmic information content of a system can be used as a steering handle in the dynamical phase space, thus affording an avenue for controlling and reprogramming systems. The method consists of applying a series of controlled interventions to a networked system while estimating how the algorithmic information content is affected. We demonstrate the method by reconstructing the phase space and their generative rules of some discrete dynamical systems (cellular automata) serving as controlled case studies. Next, the model-based interventional or causal calculus is evaluated and validated using (1) a huge large set of small graphs, (2) a number of larger networks with different topologies, and finally (3) biological networks derived from a widely studied and validated genetic network (E. coli) as well as on a significant number of differentiating (Th17) and differentiated human cells from a curated biological network data.

7 July 2017 in Physical Review E
Verified
Journal Article
Open access
PDF file
Hector ZenilHector Zenil
Hector Zenil
Narsis KianiNarsis Kiani
Narsis Kiani
JTJesper Tegner
Jesper Tegner
In estimating the complexity of objects, in particular, of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which an object, such as a graph, can be described or observed. From observations that can reconstruct the same graph and are therefore essentially translations of the same description, we see that when applying a computable measure such as the Shannon entropy, not only is it necessary to preselect a feature of interest where there is one, and to make an arbitrary selection where there is not, but also more general properties, such as the causal likelihood of a graph as a measure (opposed to randomness), can be largely misrepresented by computable measures such as the entropy and entropy rate. We introduce recursive and nonrecursive (uncomputable) graphs and graph constructions based on these integer sequences, whose different lossless descriptions have disparate entropy values, thereby enabling the study and exploration of a measure's range of applications and demonstrating the weaknesses of computable measures of complexity.

7 January 2019 in Nature Machine Intelligence
Verified
Journal Article
Closed access
PDF file
Hector ZenilHector Zenil
Hector Zenil
Narsis KianiNarsis Kiani
Narsis Kiani
AZAllan A. Zea
Allan A. Zea
JTJesper Tegner
Jesper Tegner

5 August 2025 in npj Artificial Intelligence
Verified
Journal Article
Open access
PDF file
YZYanbo Zhang
Yanbo Zhang
SKSumeer A. Khan
Sumeer A. Khan
AMAdnan Mahmud
Adnan Mahmud
HYHuck Yang
Huck Yang
ALAlexander Lavin
Alexander Lavin
Hector ZenilHector Zenil
Hector Zenil
We review how Large Language Models (LLMs) are redefining the scientific method and explore their potential applications across different stages of the scientific cycle, from hypothesis testing to discovery. We conclude that, for LLMs to serve as relevant and effective creative engines and productivity enhancers, their deep integration into all steps of the scientific process should be pursued in collaboration and alignment with human scientific goals, with clear evaluation metrics.