NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (70)

q-bio.MN2018

Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

Hector Zenil, Narsis A. Kiani, Ming-Mei Shang +1

q-bio.OT2018

An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems

Hector Zenil, Narsis A. Kiani, Francesco Marabita +5

q-bio.MN2018

Predictive Systems Toxicology

Narsis A. Kiani, Ming-Mei Shang, Hector Zenil +1

cs.ET2017

Slime mould: the fundamental mechanisms of cognition

Jordi Vallverdu, Oscar Castro, Richard Mayne +7

cs.IT2018

Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability

Hector Zenil, Liliana Badillo, Santiago Hernández-Orozco +1

cs.CC2012

Some Computational Aspects of Essential Properties of Evolution and Life

Hector Zenil, James A. R. Marshall

cs.NE2016

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

Hector Zenil, Angelika Schmidt, Jesper Tegnér

cs.IT2017

Low Algorithmic Complexity Entropy-deceiving Graphs

Hector Zenil, Narsis Kiani, Jesper Tegnér

cs.OH2016

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence

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

cs.CC2015

Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method

Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano +1

q-bio.MN2015

Quantifying Loss of Information in Network-based Dimensionality Reduction Techniques

Hector Zenil, Narsis A. Kiani, Jesper Tegnér

cs.CC2011

Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas

Hector Zenil, Jean-Paul Delahaye

cs.AI2018

Algorithmic Causal Deconvolution of Intertwined Programs and Networks by Generative Mechanism

Hector Zenil, Narsis A. Kiani, Allan A. Zea +1

cs.CY2017

Reprogramming Matter, Life, and Purpose

Hector Zenil

q-fin.ST2014

On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets

Daniel Wilson-Nunn, Hector Zenil

cs.IT2013

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures

Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1

cs.ET2018

On complexity of post-processing in analyzing GATE-driven X-ray spectrum

Neda Gholami, Mohammad Mahdi Dehshibi, Mahmood Fazlali +3

cs.CE2017

Algorithmic Data Analytics, Small Data Matters and Correlation versus Causation

Hector Zenil

cs.IT2011

An Algorithmic Approach to Information and Meaning

Hector Zenil

cs.IT2015

Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues

Hector Zenil, Narsis A. Kiani, Jesper Tegnér

cs.CC2013

Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer

Nicolas Gauvrit, Hector Zenil, Jean-Paul Delahaye +1

cs.CC2012

Computer Runtimes and the Length of Proofs: On an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving

Hector Zenil

cs.CC2012

On the Dynamic Qualitative Behaviour of Universal Computation

Hector Zenil

cs.IT2014

Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye +1

q-fin.TR2010

An algorithmic information-theoretic approach to the behaviour of financial markets

Hector Zenil, Jean-Paul Delahaye

cs.CC2013

Exploring Programmable Self-Assembly in Non-DNA based Molecular Computing

German Terrazas, Hector Zenil, Natalio Krasnogor

cs.IT2014

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

nlin.CG2018

Asymptotic Behaviour and Ratios of Complexity in Cellular Automata

Hector Zenil

nlin.CG2013

Computation and Universality: Class IV versus Class III Cellular Automata

Genaro J. Martinez, Juan C. Seck-Tuoh-Mora, Hector Zenil

cs.IT2010

Towards a stable definition of Kolmogorov-Chaitin complexity

Jean-Paul Delahaye, Hector Zenil

q-bio.MN2017

HiDi: An efficient reverse engineering schema for large scale dynamic regulatory network reconstruction using adaptive differentiation

Yue Deng, Hector Zenil, Jesper Tégner +1

cs.CC2011

Empirical Encounters with Computational Irreducibility and Unpredictability

Hector Zenil, Fernando Soler-Toscano, Joost J. Joosten

cs.AI2015

The Information-theoretic and Algorithmic Approach to Human, Animal and Artificial Cognition

Nicolas Gauvrit, Hector Zenil, Jesper Tegnér

math.LO2012

Très courte enquête sur l'extension non-triviale de la logique de propositions à la logique du premier et deuxième ordre

Hector Zenil

cs.AI2014

Quantifying Natural and Artificial Intelligence in Robots and Natural Systems with an Algorithmic Behavioural Test

Hector Zenil

cs.FL2018

Cross-boundary Behavioural Reprogrammability Reveals Evidence of Pervasive Universality

Jürgen Riedel, Hector Zenil

cs.AI2015

Natural scene statistics mediate the perception of image complexity

Nicolas Gauvrit, Fernando Soler-Toscano, Hector Zenil

cs.CC2010

On Universality in Real Computation

Hector Zenil

cs.CC2011

Complejidad descriptiva y computacional en maquinas de Turing pequenas

Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil

cs.CC2012

Turing Patterns with Turing Machines: Emergence and Low-level Structure Formation

Hector Zenil

cs.LO2015

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

cs.CC2011

Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines

Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil

math.PR2011

Sloane's Gap. Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS

Nicolas Gauvrit, Jean-Paul Delahaye, Hector Zenil

cs.IT2011

The World is Either Algorithmic or Mostly Random

Hector Zenil

cs.IT2017

A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences

Fernando Soler-Toscano, Hector Zenil

cs.CC2010

On the Algorithmic Nature of the World

Hector Zenil, Jean-Paul Delahaye

cs.CC2010

On the Kolmogorov-Chaitin Complexity for short sequences

Jean-Paul Delahaye, Hector Zenil

nlin.CG2012

Wolfram's Classification and Computation in Cellular Automata Classes III and IV

Genaro J. Martinez, J. C. Seck-Tuoh-Mora, Hector Zenil

cs.NE2016

Interacting Behavior and Emerging Complexity

Alyssa Adams, Hector Zenil, Eduardo Hermo Reyes +1

cs.CC2014

Turing Minimalism and the Emergence of Complexity

Hector Zenil

cs.NE2016

Formal Definitions of Unbounded Evolution and Innovation Reveal Universal Mechanisms for Open-Ended Evolution in Dynamical Systems

Alyssa M Adams, Hector Zenil, Paul CW Davies +1

nlin.CG2018

Rule Primality, Minimal Generating Sets, Turing-Universality and Causal Decomposition in Elementary Cellular Automata

Jürgen Riedel, Hector Zenil

cs.GL2014

Levels of Abstraction and the Apparent Contradictory Philosophical Legacy of Turing and Shannon

Hector Zenil

cs.IT2013

A Behavioural Foundation for Natural Computing and a Programmability Test

Hector Zenil

cs.IT2011

Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness

Jean-Paul Delahaye, Hector Zenil

cs.CC2016

Fractal dimension versus process complexity

Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil

cs.IT2018

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

cs.NE2007

On the possible Computational Power of the Human Mind

Hector Zenil, Francisco Hernandez-Quiroz

cs.IT2012

Introducing the Computable Universe

Hector Zenil

cs.CC2016

Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation

Hector Zenil, Jürgen Riedel

cs.NE2018

Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity

Santiago Hernández-Orozco, Narsis A. Kiani, Hector Zenil

cs.CC2015

Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility

Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye +1

nlin.CG2018

Algorithmic Information Dynamics of Persistent Patterns and Colliding Particles in the Game of Life

Hector Zenil, Narsis A. Kiani, Jesper Tegnér

cs.GL2017

Paths to Unconventional Computing: Causality in Complexity

Hector Zenil

q-bio.MN2015

Methods of Information Theory and Algorithmic Complexity for Network Biology

Hector Zenil, Narsis A. Kiani, Jesper Tegnér

cs.CC2018

Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs

Hector Zenil, Narsis A. Kiani, Jesper Tegnér

cs.CC2011

Image Characterization and Classification by Physical Complexity

Hector Zenil, Jean-Paul Delahaye, Cedric Gaucherel

q-bio.MN2016

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

cs.CC2011

Compression-based investigation of the dynamical properties of cellular automata and other systems

Hector Zenil

cs.LO2012

What is Nature-like Computation? A Behavioural Approach and a Notion of Programmability

Hector Zenil