85 citations · 742 across the 80 of their papers we have counts for
19 papers · 1 filter
Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs
Hector Zenil, Narsis A. Kiani, Jesper Tegnér
We introduce a definition of algorithmic symmetry able to capture essential aspects of geometric symmetry. We review, study and apply a method for approximating the algorithmic com…
Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation
Hector Zenil, Jürgen Riedel
We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammabil…
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…
Turing Minimalism and the Emergence of Complexity
Hector Zenil
Not only did Turing help found one of the most exciting areas of modern science (computer science), but it may be that his contribution to our understanding of our physical reality…
Exploring Programmable Self-Assembly in Non-DNA based Molecular Computing
German Terrazas, Hector Zenil, Natalio Krasnogor
Self-assembly is a phenomenon observed in nature at all scales where autonomous entities build complex structures, without external influences nor centralised master plan. Modellin…
Fractal dimension versus process complexity
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
Complexity measures are designed to capture complex behavior and quantify *how* complex, according to that measure, that particular behavior is. It can be expected that different c…