activity
20062026
most citedLow Algorithmic Complexity Entropy-deceiving Graphs

85 citations · 742 across the 80 of their papers we have counts for

collaborators
Showing 2015Show all

9 papers · 1 filter

q-bio.MN2015

Evaluating Network Inference Methods in Terms of Their Ability to Preserve the Topology and Complexity of Genetic Networks

Narsis A. Kiani, Hector Zenil, Jakub Olczak +1

Network inference is a rapidly advancing field, with new methods being proposed on a regular basis. Understanding the advantages and limitations of different network inference meth…

cs.FL2015★ 4 cited

Cross-boundary Behavioural Reprogrammability Reveals Evidence of Pervasive Universality

Jürgen Riedel, Hector Zenil

We exhaustively explore the reprogrammability capabilities and the intrinsic universality of the Cartesian product of the space of all possible computer programs o…

cs.AI2015★ 36 cited

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…

q-bio.QM2015★ 7 cited

Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results

Hector Zenil, James A. R. Marshall, Jesper Tegnér

Being able to objectively characterise the intrinsic complexity of behavioural patterns resulting from human or animal decisions is fundamental for deconvolving cognition and desig…

cs.NE2015★ 1 cited

Causality, Information and Biological Computation: An algorithmic software approach to life, disease and the immune system

Hector Zenil, Angelika Schmidt, Jesper Tegnér

Biology has taken strong steps towards becoming a computer science aiming at reprogramming nature after the realisation that nature herself has reprogrammed organisms by harnessing…

cs.LO2015★ 1 cited

Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value

Santiago Hernández-Orozco, Francisco Hernández-Quiroz, Hector Zenil +1

We show that strategies implemented in automatic theorem proving involve an interesting tradeoff between execution speed, proving speedup/computational time and usefulness of infor…