66 citations · 173 across the 8 of their papers we have counts for
10 papers
Mathematical transcription of the "Time-Based Resource Sharing" theory of working memory
Nicolas Gauvrit, Fabien Mathy
The time-based resource sharing (TBRS) model is a prominent model of working memory that is both predictive and simple. The TBRS is the mainstream decay-based model and the most su…
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…
The Information-theoretic and Algorithmic Approach to Human, Animal and Artificial Cognition
Nicolas Gauvrit, Hector Zenil, Jesper Tegnér
We survey concepts at the frontier of research connecting artificial, animal and human cognition to computation and information processing---from the Turing test to Searle's Chines…
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…
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye +1
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating -dimensional…
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1
We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministi…