Publications (18)
Natural scene statistics mediate the perception of image complexity
Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil
Complejidad descriptiva y computacional en maquinas de Turing pequenas
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
Fractal dimension versus process complexity
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
Hector Zenil, Santiago Hernández-Orozco, Narsis A. Kiani +2
Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks
Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle +1
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method
Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano +1
Forgetting complex propositions
David Fernández-Duque, Ãngel Nepomuceno-Fernández, Enrique Sarrión-Morrillo +2
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye +1
A geometric protocol for cryptography with cards
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque +1
Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
A secure additive protocol for card players
Andres Cordon-Franco, Hans van Ditmarsch, David Fernandez-Duque +2
Empirical Encounters with Computational Irreducibility and Unpredictability
Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten
Which is the least complex explanation? Abduction and complexity
Fernando Soler-Toscano
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
A colouring protocol for the generalized Russian cards problem
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque +1
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
Fernando Soler-Toscano, Hector Zenil
Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer
Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye +1