85 citations · 742 across the 80 of their papers we have counts for
7 papers · 1 filter
An Algorithmic Approach to Information and Meaning
Hector Zenil
I will survey some matters of relevance to a philosophical discussion of information, taking into account developments in algorithmic information theory (AIT). I will propose that…
The World is Either Algorithmic or Mostly Random
Hector Zenil
I will propose the notion that the universe is digital, not as a claim about what the universe is made of but rather about the way it unfolds. Central to the argument will be the c…
Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer
Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye +1
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to…
Empirical Encounters with Computational Irreducibility and Unpredictability
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues…
Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
The aim of this paper is to undertake an experimental investigation of the trade-offs between program-size and time computational complexity. The investigation includes an exhausti…
Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness
Jean-Paul Delahaye, Hector Zenil
We describe an alternative method (to compression) that combines several theoretical and experimental results to numerically approximate the algorithmic (Kolmogorov-Chaitin) comple…