85 citations · 742 across the 80 of their papers we have counts for
7 papers · 1 filter
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…
Algorithmic Data Analytics, Small Data Matters and Correlation versus Causation
Hector Zenil
This is a review of aspects of the theory of algorithmic information that may contribute to a framework for formulating questions related to complex highly unpredictable systems. W…
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
We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empiric…
Computation and Universality: Class IV versus Class III Cellular Automata
Genaro J. Martinez, Juan C. Seck-Tuoh-Mora, Hector Zenil
This paper examines the claim that cellular automata (CA) belonging to Class III (in Wolfram's classification) are capable of (Turing universal) computation. We explore some chaoti…
Asymptotic Behaviour and Ratios of Complexity in Cellular Automata
Hector Zenil
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of comple…