Hector Zenil
Orcid: 0000-0003-0634-4384
According to our database1,
Hector Zenil
authored at least 135 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on mathrix.org
On csauthors.net:
Bibliography
2024
Fractal spatio-temporal scale-free messaging: amplitude modulation of self-executable carriers given by the Weierstrass function's components.
CoRR, 2024
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution.
CoRR, 2024
Proceedings of the 57th Hawaii International Conference on System Sciences, 2024
2023
The Future of Fundamental Science Led by Generative Closed-Loop Artificial Intelligence.
CoRR, 2023
Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of Models.
CoRR, 2023
2022
Computable model discovery and high-level-programming approximations to algorithmic complexity.
Theor. Comput. Sci., 2022
Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results.
Frontiers Comput. Neurosci., 2022
On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular Biosignatures.
CoRR, 2022
Model Discovery and Discrete Inverse Problems with Cellular Automata and Boolean Networks.
Proceedings of the Automata and Complexity, 2022
Methods and Applications of Algorithmic Complexity - Beyond Statistical Lossless Compression
44, Springer, ISBN: 978-3-662-64983-1, 2022
2021
Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional Networks.
Entropy, 2021
Algorithmic Probability of Large Datasets and the Simplicity Bubble Problem in Machine Learning.
CoRR, 2021
Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity.
CoRR, 2021
A Computable Piece of Uncomputable Art whose Expansion May Explain the Universe in Software Space.
CoRR, 2021
2020
Parallel Process. Lett., 2020
A Novel Method for Reconstructing CT Images in GATE/GEANT4 with Application in Medical Imaging: A Complexity Analysis Approach.
J. Inf. Process., 2020
Frontiers Artif. Intell., 2020
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions.
Entropy, 2020
A Review of Methods for Estimating Algorithmic Complexity and Beyond: Options, and Challenges.
CoRR, 2020
Proceedings of the Complex Networks & Their Applications IX, 2020
Proceedings of the IEEE Congress on Evolutionary Computation, 2020
Proceedings of the Metrics of Sensory Motor Coordination and Integration in Robots and Animals, 2020
2019
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability.
Int. J. Parallel Emergent Distributed Syst., 2019
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy.
Entropy, 2019
Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces.
CoRR, 2019
Compression is Comprehension, and the Unreasonable Effectiveness of Digital Computation in the Natural World.
CoRR, 2019
Algorithmic Information Dynamics of Emergent, Persistent, and Colliding Particles in the Game of Life.
Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019
2018
Parallel Process. Lett., 2018
Rule Primality, Minimal Generating Sets and Turing-Universality in the Causal Decomposition of Elementary Cellular Automata.
J. Cell. Autom., 2018
Cross-boundary Behavioural Reprogrammability Reveals Evidence of Pervasive Universality.
Int. J. Unconv. Comput., 2018
A Review of Graph and Network Complexity from an Algorithmic Information Perspective.
Entropy, 2018
Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations.
Entropy, 2018
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
Entropy, 2018
Controllability, Multiplexing, and Transfer Learning in Networks using Evolutionary Learning.
CoRR, 2018
An Algorithmic Refinement of Maxent Induces a Thermodynamic-like Behaviour in the Reprogrammability of Generative Mechanisms.
CoRR, 2018
Ab initio Algorithmic Causal Deconvolution of Intertwined Programs and Networks by Generative Mechanism.
CoRR, 2018
Algorithmic Information Dynamics of Persistent Patterns and Colliding Particles in the Game of Life.
CoRR, 2018
Parameter-free Network Sparsification and Data Reduction by Minimal Algorithmic Information Loss.
CoRR, 2018
Artif. Life, 2018
2017
CoRR, 2017
Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, modularity, diversity explosions, and mass extinction.
CoRR, 2017
CoRR, 2017
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences.
Complex., 2017
HiDi: an efficient reverse engineering schema for large-scale dynamic regulatory network reconstruction using adaptive differentiation.
Bioinform., 2017
Proceedings of the Unveiling Dynamics and Complexity, 2017
2016
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
CoRR, 2016
CoRR, 2016
Formal Definitions of Unbounded Evolution and Innovation Reveal Universal Mechanisms for Open-Ended Evolution in Dynamical Systems.
CoRR, 2016
Quantifying loss of information in network-based dimensionality reduction techniques.
J. Complex Networks, 2016
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016
Proceedings of the Fifteenth International Conference on the Simulation and Synthesis of Living Systems, 2016
2015
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility.
PeerJ Comput. Sci., 2015
Algorithmicity and programmability in natural computing with the Game of Life as <i>in silico</i> case study.
J. Exp. Theor. Artif. Intell., 2015
Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results.
CoRR, 2015
Cross-boundary Behavioural Reprogrammability of Cellular Automata from Emulation Networks.
CoRR, 2015
Evaluating Network Inference Methods in Terms of Their Ability to Preserve the Topology and Complexity of Genetic Networks.
CoRR, 2015
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value.
CoRR, 2015
The Information-theoretic and Algorithmic Approach to Human, Animal and Artificial Cognition.
CoRR, 2015
Artif. Life, 2015
Proceedings of the 11th International Conference on Signal-Image Technology & Internet-Based Systems, 2015
Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015
2014
Quantifying Natural and Artificial Intelligence in Robots and Natural Systems with an Algorithmic Behavioural Test.
CoRR, 2014
Levels of Abstraction and the Apparent Contradictory Philosophical Legacy of Turing and Shannon.
CoRR, 2014
CoRR, 2014
Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method.
CoRR, 2014
2013
Ubiquity symposium: Evolutionary computation and the processes of life: some computational aspects of essential properties of evolution and life.
Ubiquity, 2013
Nat. Comput., 2013
Nat. Comput., 2013
Int. J. Bifurc. Chaos, 2013
Graph Automorphism and Topological Characterization of Synthetic and Natural Complex Networks by Information Content.
CoRR, 2013
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures.
Comput., 2013
Proceedings of the Twelfth European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, 2013
Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013
2012
Minds Mach., 2012
J. Cell. Autom., 2012
Information Theory and Computational Thermodynamics: Lessons for Biology from Physics.
Inf., 2012
Entropy, 2012
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
CoRR, 2012
What is Nature-like Computation? A Behavioural Approach and a Notion of Programmability
CoRR, 2012
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
CoRR, 2012
CoRR, 2012
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness.
Appl. Math. Comput., 2012
Computer Runtimes and the Length of Proofs - With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving.
Proceedings of the Computation, Physics and Beyond, 2012
2011
PhD thesis, 2011
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines.
Int. J. Unconv. Comput., 2011
CoRR, 2011
Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
CoRR, 2011
2010
CoRR, 2010
CoRR, 2010
Compression-Based Investigation of the Dynamical Properties of Cellular Automata and Other Systems.
Complex Syst., 2010
2009
2008
2007
2006
2005
2004
IEEE Distributed Syst. Online, 2004
2003
How to Secure Your Enterprise (A review of Securing Business Information: Strategies to Protect the Enterprise and Its Network by F. Christian Byrnes and Dale Kutnick).
IEEE Distributed Syst. Online, 2003
How to Develop Enterprise-Secure Java Applications Learning Risks (A review of Hacking Exposed J2EE and Java, Developing Secure Applications with Java Technology by Art Taylor, Brian Buege, and Randy Layman).
IEEE Distributed Syst. Online, 2003
2002
Book Review: Good JavaServer Pages Introduction (A review of Web Development with JavaServer Pages, 2nd edition by Duane K. Fields and Mark A. Kolb).
IEEE Distributed Syst. Online, 2002