1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
Sloane's Gap. Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS
Nicolas Gauvrit, Jean-Paul Delahaye, Hector Zenil
The Online Encyclopedia of Integer Sequences (OEIS) is made up of thousands of numerical sequences considered particularly interesting by some mathematicians. The graphic represent…
Complejidad descriptiva y computacional en maquinas de Turing pequenas
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the ex…
An algorithmic information-theoretic approach to the behaviour of financial markets
Hector Zenil, Jean-Paul Delahaye
Using frequency distributions of daily closing price time series of several financial market indexes, we investigate whether the bias away from an equiprobable sequence distributio…