75 citations · 263 across the 13 of their papers we have counts for
17 papers
Which is the least complex explanation? Abduction and complexity
Fernando Soler-Toscano
It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are…
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
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 com…
Natural scene statistics mediate the perception of image complexity
Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil
Humans are sensitive to complexity and regularity in patterns. The subjective perception of pattern complexity is correlated to algorithmic (Kolmogorov-Chaitin) complexity as defin…
Forgetting complex propositions
David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morrillo +2
This paper uses possible-world semantics to model the changes that may occur in an agent's knowledge as she loses information. This builds on previous work in which the agent may f…
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
Fernando Soler-Toscano, Hector Zenil
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at chara…
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method
Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano +1
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph…