Over 140 peer-reviewed contributions indexed in DBLP. H-index and citations on Google Scholar.
Numbering code — J: journal · P: proceeding or chapter · # co-first author if not listed first · * corresponding author · ^ sorted alphabetically
140 · J89Similarity analysis of blood count reference intervals reveals no ethnic or geographic structure and supports personalised valuesK. Wu, A. Uthamacumaran, A. Fulton, H. Zenilnpj Digital Public Health, vol. 1, no. 1, art. 32, 2026
139 · J88A Review of Point-of-Care Devices for Blood-Testing Towards AI-driven Remote Digital Care, Precision Healthcare and Predictive MedicineJ. Gu, A. Uthamacumaran, H. ZenilComputer Methods and Programs in Biomedicine Update, vol. 10, 100258, 2026
138 · J87Multi-omic Enriched Blood-Derived Digital Signatures Reveal Mechanistic and Confounding Disease Clusters for Differential DiagnosisB. Liu, A. Uthamacumaran, A. Fulton, H. ZenilFrontiers in Network Physiology, vol. 6, 2026
137 · J86Binarized neural networks converge toward algorithmic simplicity: empirical support for the learning-as-compression hypothesisE. Y. Sakabe, F. S. Abrahão, A. Simões, E. Colombini, P. Costa, R. Gudwin, H. ZenilFrontiers in Computational Neuroscience, vol. 20, 1791546, 2026
136 · J85A quantitative approach to estimating bias, favoritism and distortion in scientific journalismR. Koushik, H. ZenilFrontiers in Communication, vol 11, 1772794, 2026
135 · J84Integrative adaptive indexes from noisy routine haematological markers can predict and discriminate health status and biological ageS. Hernandez-Orozco, A. Uthamacumaran, F. Hernandez-Quiroz, K. Saeb-Parsy, H. ZenilComputers in Biology and Medicine, vol 208, 111628, 2026
134 · J83SuperARC: a test for artificial superintelligence based on compressed modelling, recursive prediction and problem complexityA. Hernández-Espinosa, L. Ozelim, F. S. Abrahão, H. ZenilNature Communications, 17: 4885, 2026
133 · J82Neurodivergent Influenceability as a Contingent Solution to the AI Alignment ProblemA. Hernández-Espinosa, F.S Abrahão, O. Witkowski, H. ZenilPNAS Nexus, vol. 5:4, pgag076, 2026
132 · J81Assembly Theory Collapses to Dictionary Compression and Is Rendered Redundant by Common Statistical AlgorithmsL. Ozelim, A. Uthamacumaran, F.S Abrahão, S. Hernández-Orozco, N.A Kiani, J. Tegnér, H. Zenilnpj Complexity, 2026
131 · J80The future of fundamental science led by generative closed-loop artificial intelligenceH Zenil, J Tegnér, FS Abrahão, A Lavin, V Kumar, JG Frey, A Weller,.Frontiers in Artificial Intelligence 11;9:1678539, 2026
130 · J79Leveraging network motifs to improve artificial neural networksH. Zhang, C.-H. Yang, H. Zenil, P.-Y. Chen, Y. Shen, N. A. Kiani, and J. TegnerNature Communications, 16: 11495 2025
129 · P53On Circular Growth of Life-Like AutomataG.J. Martínez, A. Adamatzky, H. Zenil, J.C. Seck-Tuoh-Mora In: A. Adamatzky, G.C. Sirakoulis, G.J. Martinez (eds) Advances in Cellular Automata. Emergence, Complexity and Computation, vol 53.Springer Nature, 2025.
128 · J78Advancing the Scientific Method with Large Language Models: From Hypothesis to DiscoveryY. Zhang, i.a. M. Levin, J. Frey, J. Evans, A. Bundy and H. Zenilnpj Artificial Intelligence 1, 14, 2025.
127 · J77On Sequential Structures in Incompressible Multidimensional NetworksF.S. Abrahao, K. Wehmuth, H. Zenil, and A. ZivianiParallel Processing Letters Vol. 34, No. 03n04, 2450011, 2024
126 · P52The Emergent Behavior of Computer Programs of Short Description Length in Discrete Time and Discrete SpaceH. ZenilFoundational Papers in Complexity Science pp. 1735–1792, Santa Fe Institute, 2024 [online, partial preprint].
125 · P51The Emergent Behavior of Computer Programs of Short Description Length in Discrete Time and Discrete SpaceHector Zenil Introduction to Universality and Complexity in Cellular Automata by Stephen Wolfram, InFoundational Papers in Complexity Science: Volume I by David C. Krakauer, 2024.
124 · J75Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum CircuitJun Qi, Chao-Han Huck Yang, Pin-Yu Chen, Min-Hsiu Hsieh, Hector Zenil, Jesper Tegner2024
123 · J74Scientific Hypothesis Generation by a Large Language Model: Laboratory Validation in Breast Cancer TreatmentA. Abdel-Rehim, H. Zenil, i.a., Ross D. KingRoyal Society Interface 22: 20240674. 2025.
122 · J73Decoding Geometric Properties in Non-Random Data from First Information-Theoretic PrinciplesHector Zenil, Felipe S. Abrahão, 2024.
121 · J72Fractal spatio-temporal scale-free messaging: amplitude modulation of self-executable carriers given by the Weierstrass function's componentsH Zenil, L.C. de Sena Monteiro OzelimInformation Sciences, vol. 706, 121988, 2025.
120 · J71Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolutionF.S. Abrahão, S. Hernández-Orozco, N.A. Kiani, J. Tegnér, H. ZenilPLOS Complex Systems, 1(1): e0000014, 2024
119Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of ModelsH. Zenil, A. Adams, F.S. Abrahão (submitted)
118 · J70On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular BiosignaturesA. Uthamacumaran, F.S. Abrahão, N.A. Kiani, H. Zenilnpj Systems Biology and Applications 10, 82, 2024.
117 · J69A Review of Mathematical and Computational Methods in Cancer DynamicsA. Uthamacumaran and H. ZenilFrontiers in Oncology, vol. 12, 2022
116 · P50Artificial intelligence in scientific discovery: Challenges and opportunitiesH. Zenil and R. King inArtificial Intelligence in Science: Challenges, Opportunities and the Future of Research, OECD Publishing, Paris, 2023.
115 · P49A framework for evaluating the AI-driven automation of scienceH. Zenil and R. King inScience: Challenges, Opportunities and the Future of Research, OECD Publishing, Paris, 2023
114 · P47The Far Future of AI in Scientific DiscoveryH. Zenil and R. King In Choudhary, Fox and Tony Hey, AI For Science, World Scientific Publishing Company/Imperial College Press, 2023.
113 · J68Simulation Intelligence: Towards a New Generation of Scientific MethodsA. Lavin, H. Zenil, B. Paige, D. Krakauer, J. Gottschlich, T. Mattson, A. Anandkumar, S. Choudry, K. Rocki, A. Güneş Baydin, C. Prunkl, O. Isayev, E. Peterson, P. L. McMahon, J. Macke, K. Cranmer, J. Zhang, H. Wainwright, A. Hanuka, M. Veloso, S. Assefa, S. Zheng, A. Pfeffer (forthcoming)
112 · J67Emergence and Algorithmic Information Dynamics of Systems and ObserversF. S. Abrahão and H. ZenilPhilosophical Transactions of the Royal Society A, 2022
111 · J66Algorithmic Probability of Large Datasets and the Simplicity Bubble Problem in Machine LearningF.S. Abrahão, H. Zenil, F. Porto, and K. Wehmuth (forthcoming)
110 · P46Algorithmic Information Dynamics of Cellular AutomataH. Zenil and A. Adams In S. Das et al (eds) The Mathematical Artist: A Tribute to John Horton Conway World Scientific Publishing Press, 2022
109 · J65Computable model discovery and high-level-programming approximations to algorithmic complexityV. Lemusa, E. Acuña, V. Zamora, F. Hernandez-Quiroz, H. Zenil Theoretical Computer Science, Elsevier, 2022.
108 · P45A Computable Piece of Uncomputable Art whose Expansion May Explain the Universe in Software SpaceH. Zenil In A. Adamatzky, Unconventional Computing, Arts, Philosophy, World Scientific Publishing Company, 2022
107 · P44Artificial Intelligence in Medicine and Causality for Precision and Value-based HealthcareH. Zenil In N. Lidströmer and H. Ashrafian (eds.)Artificial Intelligence in Medicine, Springer Verlag, 2021
106 · P43Causal Diagnostics for Cancer and Complex DiseasesH. Zenil In I. Balaz and A. Adamatzky, Cancer, Complexity, Computation, World Scientific Publishing CompanySpringer, 2021
104 · J64Algorithmic Probability-guided Machine Learning On Non-differentiable SpacesS. Hernández-Orozco, H. Zenil, J. Riedel, A. Uccello, N.A. Kiani, and J. TegnérFrontiers in Artificial Intelligence, 25, 2021.
103 · P41Algorithmic Information DynamicsH. Zenil, N.A. Kiani, F.S. Abrahao and J. TegnérScholarpedia, 15(7):53143, 2020.
102 · J63Non-Classical Logics in Unconventional ComputingA. Schumann and H. Zenil International Journal of Unconventional Computing, pp. 237-244, vol. 15, No.4, 2020
101 · J62A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New DirectionsH. ZenilEntropy, 22, 612, 2020. (special issue on Shannon Entropy and Kolmogorov complexity)
100 · P40Evolving Neural Networks through a Reverse Encoding TreeH. Zhang, C-H. Huck Yang, H. Zenil, N.A. Kiani, Y. Shen and J. TegnérIEEE World Congress on Computational Intelligence 2020.
99 · P39Algorithmic Information Distortions in Node-Aligned and Node-Unaligned Multidimensional NetworksF.S. Abrahao, K. Wehmuth, H. Zenil, and A. ZivianiEntropy 2021, 23(7), 835
98 · J60Towards Demystifying Shannon Entropy, Lossless Compression, and Approaches to Statistical Machine LearningH. Zenil Proceedings 47, no. 1: 24, 2020
96 · J58A Novel Method for Reconstructing CT Images in GATE/GEANT4 with Application in Medical Imaging: A Complexity Analysis ApproachN. Gholamia, M. Mahdi Dehshibia, M. Fazlalib, A. Rueda-Toicen, H. Zenil, A. AdamatzkyJournal of Information Processing, vol. 28 pp. 161–168, 2020.
95 · P38Compression is Comprehension, and the Unreasonable Effectiveness of Digital Computation in the Natural WorldH. Zenil In S. Wuppuluri, F. Doria (eds.) Unravelling Complexity (Gregory Chaitin’s 70 festschrift), World Scientific Publishing, 2019.
94 · J57Controllability, Multiplexing, and Transfer Learning in Networks using Evolutionary LearningR. Ooi, C.-H. Huck Yang, P.-Yu Chen, V. Eguiluz, N.A. Kiani, H. Zenil, D. Gómez-Cabrero, J. Tegnér (submitted)
93 · P37Estimations of Integrated Information Based on Algorithmic Complexity and Dynamic QueryingA. Hernández-Espinosa, H. Zenil^, N.A. Kiani, and J. Tegnér In Handbook of Unconventional Computing, A. Adamatzky (Ed.), World Scientific Publishing Company, 2022
92 · J56A Review of Graph and Network Complexity from an Algorithmic Information PerspectiveH. Zenil, N.A. Kiani, J. TegnérEntropy, 20(8):551, 2018.
91 · J55Training-free Measures Based on Algorithmic Probability Identify High Nucleosome Occupancy in DNA SequencesH. Zenil, P. MinaryNucleic Acids Research, gkz750, 2019 (Oxford)
90 · J54Community assessment to advance computational prediction of cancer drug combinations in a pharmacogenomic screenS.M Hill, L.M. Heiser, (…) i.a. H. Zenil (DREAM Challenge Consortium) (…), G. Stolovitzky, J. Guinney, J.R Dry, J. Saez-RodriguezNature Communications, vol. 10, Article number: 2674, 2019. (NPG)
89 · P36On the Complex Behaviour of Natural and Artificial Machines and SystemsH. Zenil In F.P. Bonsignorio, A.P. del Pobil, E. Messina, J. Hallam (eds.), Metrics of sensory motor integration in robots and animals Springer Cosmos Series, Cognitive Systems Monographs, Springer, pp.111-125,2019 [Amazon, preprint]
88 · J53Minimal Algorithmic Information Loss Methods for Dimension Reduction, Feature Selection and Network SparsificationH. Zenil, N.A. Kiani, A. Rueda-Toicen, A. Zea, J. TegnérInformation Sciences 720 (2025) 122520
87 · J52The Thermodynamics of Network Coding, and Algorithmic Refinement of the principle of Maximum EntropyH. Zenil, N.A. Kiani, J. TegnérEntropy, 21(6), 560, 2019 (MDPI)
85 · J50Algorithmically Probable Mutations Reproduce Aspects of Evolution, such as Convergence Rate, Genetic Memory, and ModularityS. Hernández-Orozco, N.A. Kiani, H. ZenilRoyal Society Open Science, 5:180399, 2018 (Royal Society)
84 · J49A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic ComplexityH. Zenil, S. Hernández-Orozco, N.A. Kiani, F. Soler-Toscano, A. Rueda-ToicenEntropy 20(8), 605, 2018. (MDPI)
83 · P35Algorithmic Information Dynamics of Emergent, Persistent, and Colliding Particles in the Game of LifeH. Zenil, N.A. Kiani and J. Tegnér In A. Adamatzky (ed), From Parallel to Emergent Computing (book) Taylor & Francis / CRC Press, pp.367–383, 2019
82 · P34Model Discovery and Discrete Inverse Problems with Cellular Automata and Boolean NetworksH. Zenil, Y. Zhang and N.A. Kiani In A. Adamatzky, Automata and Complexity, Eric Goles festschriftSpringer, 2022.
81 · J48Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological RepresentationsH. Zenil, N.A. Kiani and J. TegnérEntropy, 20(7), 534, 2018
80 · J47Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic ProbabilityH. Zenil, L. Badillo, S. Hernández-Orozco and F. Hernandez-QuirozInternational Journal of Parallel Emergent and Distributed Systems, 2018 [online, preprint] (Taylor & Francis)
79 · J46Rule Primality, Minimal Generating Sets and Turing-Universality in the Causal Decomposition of Elementary Cellular AutomataJ. Riedel and H. Zenil^Journal of Cellular Automata, vol. 13, pp. 479–497, 2018
78 · J45Algorithmic Complexity and Reprogrammability of Chemical Structure NetworksH. Zenil, N.A. Kiani, M-M. Shang, J. TegnérParallel Processing Letters, vol. 28, 2018. (World Scientific)
77 · J44Cross-boundary Behavioural Reprogrammability Reveals Evidence of Pervasive UniversalityJ. Riedel, H. Zenil^International Journal of Unconventional Computing, vol 13:14-15 pp. 309-357, 2018
76 · J43Slime Mould: The Fundamental Mechanisms of Biological CognitionJ. Vallverdú, O. Castro, R. Mayne, M. Talanov, M. Levine, F. Baluska, Y. Gunji, A. Dussutourg, H. Zenil, A. AdamatzkyBioSystems, vol. 165, pp 57-70, 2018 (Elsevier)
75 · J42Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental ResultsH. Zenil, J.A.R. Marshall, J. TegnérFrontiers In Computational Neuroscience, vol. 16, 2023
74 · J41Shortening of proof length is elusive for theorem proversS. Hernández-Orozco, H. Zenil, F. Hernández-Quiroz, W. SiegParallel Processing Letters, Vol. 30, No. 04, 2050013, 2020
73 · J40Undecidability and Irreducibility Conditions for Open-Ended Evolution and EmergenceS. Hernández-Orozco, F. Hernández-Quiroz and H. ZenilArtificial Life, vol. 24:1, pp. 56–70, 2018 (MIT)
72 · J39A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer SequencesF. Soler-Toscano, H. ZenilComplexity vol. 2017 (2017), Article ID 7208216 (Wiley/Hindawi)
71 · J38Reprogramming Matter, Life and Purpose.H. ZenilInternational Journal of Unconventional Computing, vol. 13.3, p. 221–233, 2017. (OCP)
70 · J37HiDi: An efficient reverse engineering schema for large scale dynamic regulatory network reconstruction using adaptive differentiationY. Deng, H. Zenil, J. Tegnér, N.A. KianiBioinformatics btx501, 2017. (Oxford)
69 · J36East-West Paths to Unconventional Computing: Complexity in CausalityS. Akl, M. Burgin, C.S. Calude, M.M. Dehshibi, Y. Gunji, Z. Konkoli, B. Maclenna, B. Marchal, M. Margenstern, G.J. Martinez, R. Mayne, K. Morita, A. Schumann, G.Ch. Sirakoulis, K. Svozil, H. Zenil, A. AdamatzkyProgress in Biophysics & Molecular Biology, 131:469–493, 2017. doi: 10.1016/j.pbiomolbio.2017.08.004. (Elsevier)
68 · J35Low Algorithmic Complexity Entropy-deceiving GraphsH. Zenil, N.A. Kiani and J. TegnérPhysical Review E 96, 012308, 2017. (APS)
67 · J34Formal Definitions of Unbounded Evolution and Innovation Reveal Universal Mechanisms for Open-Ended Evolution in Dynamical SystemsA. Adams, H. Zenil, P.W.C. Davies, S.I. WalkerScientific Reports 7, No:997, 2017. (NPG)
66 · J33Human Behavioral Complexity Peaks at Age 25N. Gauvrit, H. Zenil, F. Soler-Toscano, J.-P. Delahaye, P. BruggerPLoS Comput Biol 13(4): e1005408, 2017. [online, video, supplementary information (SI)] (PLOS)
65 · P33Predictive Systems ToxicologyN.A. Kiani, M. Shang, H. Zenil and J. Tegnér In Orazio Nicolotti (ed.), Computational Toxicology – Methods and Protocols, Methods in Molecular BiologySpringer, 2017.
64 · P32Approximations to Algorithmic ProbabilityH. Zenil In Robert A. Meyers (ed), 2nd. Edition of theSpringer Encyclopedia of Complexity and Systems Science, 2017.
63 · P31Cognition and the Algorithmic Nature of the MindH. Zenil In Robert A. Meyers (ed), 2nd. Edition of theSpringer Encyclopedia of Complexity and Systems Science, 2017.
62 · P30The Information-theoretic and Algorithmic Approach to Human, Animal and Artificial CognitionN. Gauvrit, H. Zenil#, J. Tegnér In G. Dodig-Crnkovic and R. Giovagnoli (Eds.) Representation and reality : Humans, animals and machines.Springer, pp 117-139, 2017.
61 · P29Is there any Real Substance to the Claims for a ‘New Computationalism’?A. Hernández-Espinosa, F. Hernández-Quiroz and H. Zenil In J. Kari, F. Manea, I. Petre (eds) Unveiling Dynamics and Complexity (Computability in Europe 2017), Springer Verlag, 2017.
60 · P28Causality, Information and Biological Computation: An algorithmic software approach to life, disease and the immune systemH. Zenil, A. Schmidt, J. Tegnér In S I. Walker, P.C.W. Davies and G. Ellis (eds.), Information and Causality: From Matter to Life.Cambridge University Press, pp. 244-279, 2017. [preprint, Amazon]
59 · P27Algorithmic Data Analytics, Small Data Matters and Correlation versus CausationH. Zenil In M. Ott, W. Pietsch, J. Wernecke (eds.), Berechenbarkeit der Welt? Philosophie und Wissenschaft im Zeitalter von Big Data (Computability of the World? Philosophy and Science in the Age of Big Data)Springer Verlag, pp 453-475, 2017.
58 · J32Perspective on Bridging Scales and Design of Models using Low-Dimensional Manifolds & Data-driven Model InferenceJ. Tegner, H. Zenil, N.A. Kiani, G. Ball, D. Gomez-CabreroPhilosophical Transactions of the Royal Society A, volume 374, issue 2080, 2016. (Royal Society)
57 · J31Inferring causal molecular networks: Empirical Assessment of Causal Network Learning through a Community-based EffortS.M Hill, L.M. Heiser, (…) i.a. H. Zenil (DREAM Challenge Consortium) (…), S. Mukherjee, G. Stolovitzky, J. Saez-RodriguezNature Methods 13, pp. 310–318, 2016.(NPG)
56 · J30Methods of Information Theory and Algorithmic Complexity for Network BiologyH. Zenil, N.A. Kiani and J. TegnérSeminars in Cell and Developmental Biology, vol. 51, pp. 32-43, 2016. (Elsevier)
55 · J29Fractal Dimension versus Process ComplexityJ.J. Joosten, F. Soler-Toscano, and H. ZenilAdvances in Mathematical Physics vol. 2016, Article ID 5030593 (Hindawi)
54 · J28Flow of Information in Biological SystemsA. Masoudi-Nejad and H. ZenilSeminars in Cell and Developmental Biology, vol. 51 pp 1-2, 2016. (Elsevier)
53 · J27Quantifying Loss of Information in Network-based Dimensionality Reduction TechniquesH. Zenil, N.A. Kiani, J. TegnérJournal of Complex Networks, vol. 4:(3) pp. 342-362, 2016. (Oxford)
52 · J26Evaluating Network Inference Methods in Terms of Their Ability to Preserve the Topology and Complexity of Genetic NetworksN.A. Kiani, H. Zenil#, J. Olczak and J. TegnérSeminars in Cell and Developmental Biology, vol. 51, pp. 44-52, 2016. (Elsevier)
51 · P26The Limits of Decidable States on Open-Ended Evolution and EmergenceS. Hernández-Orozco, F. Hernández-Quiroz and H. ZenilArtificial Life, vol. 24(1) pp. 56-70, 2018. (MIT)
50 · P25Formal definitions of Unbounded Evolution and Innovation Reveal universal Mechanisms for Open-ended evolution in Dynamical SystemsA. Adams, H. Zenil, P.C.W. Davies and S.I. Walker Second Workshop on Open-Ended Evolution, 15th International Conference on the Synthesis and Simulation of Living Systems (ALIFE), 2016.
49 · P24Asymptotic Intrinsic Universality and Reprogrammability by Behavioural EmulationH. Zenil and J. Riedel Advances in Unconventional Computation. A. Adamatzky (ed)Springer Verlag, pp. 205-220, 2016.
48 · J25Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem methodN. Gauvrit, H. Singmann, F. Soler-Toscano, H. ZenilBehavior Research Methods, Volume 48, Issue 1, pp. 1-16, 2015. doi:10.3758/s13428-015-0574-3 (Springer)
47 · P23Topological Evaluation of Methods for Reconstruction of Genetic Regulatory NetworksJ. Olczak, N.A. Kiani, H. Zenil and J. Tegnér Proceedings of the IEEE Workshop on Complex Networks, SITIS, Bangkok 2015.
46 · P22Numerical Investigation of Graph Spectra and Information Interpretability of EigenvaluesH. Zenil, N.A. Kiani, J. Tegnér In F. Ortuño & I. Rojas (Eds.): 3rd International Work-Conference on Bioinformatics andBiomedical Engineering (IWBBIO) 2015, Part II, LNCS 9044, pp. 395–405. Springer, 2015.
45 · P21The Effects of Global Rules on Interacting Cellular AutomataA. Adams, H. Zenil, E. Reyes, J. Joosten In J. Kari, I. Törmä, M. Szabados (Eds.), 21st International Workshop on Cellular Automata and Discrete Complex Systems AUTOMATA 2015, TUCS Lecture Notes, 2015.
44 · J24Algorithmicity and Programmability in Natural Computing with the Game of Life as an In Silico Case StudyH. ZenilJournal of Experimental & Theoretical Artificial Intelligence, Volume 27, Issue 1, pp. 109-121, 2015. (Taylor & Francis)
43 · J23Complexity Measurement Based on Information Theory and Kolmogorov ComplexityL. Ting Lui, G. Terrazas, H. Zenil, C. Alexander and N. KrasnogorArtificial Life, vol. 21:2, pp. 205-24 2015.(MIT Press)
42 · J22Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by CompressibilityH. Zenil, F. Soler-Toscano, J.-P. Delahaye and N. GauvritPeerJ Computer Science, 1:e23, 2015. (PeerJ)
40 · J20Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing MachinesF. Soler-Toscano, H. Zenil#^, J.-P. Delahaye and N. GauvritPLoS ONE 9(5): e96223, 2014. [online, data, online program, Mathematica API, R package] (PLOS)
39 · J19Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex NetworksH. Zenil, F. Soler-Toscano, K. Dingle and A. LouisPhysica A: Statistical Mechanics and its Applications, vol. 404, pp. 341–358, 2014. [online, preprint, video] (Elsevier)
38 · P20Programmability: A Turing Test Approach to ComputationH. Zenil In L. De Mol and G. Primiero (eds.), Turing in Context, Koninklijke Vlaamse Academie van België voor Wetenschappen en Kunsten (Belgian Academy of Sciences and Arts), Contactforum, 2014.
37 · J18Algorithmic complexity for short binary strings applied to psychology: a primerN. Gauvrit, H. Zenil, F. Soler-Toscano and J.-P. DelahayeBehavior Research Methods, vol. 46-3, pp 732-744, 2014. doi: 10.3758/s13428-013-0416-0 (Springer)
35 · J16Correspondence and Independence of Numerical Evaluations of Algorithmic Information MeasuresF. Soler-Toscano, H. Zenil#, J.-P. Delahaye and N. GauvritComputability, vol. 2, no. 2, pp 125-140, 2013. (IOS)
34 · J15Exploring Programmable Self-Assembly in Non DNA-based ComputingG. Terrazas, H. Zenil and N. KrasnogorNatural Computing, vol 12(4): 499–515, 2013. doi:10.1007/s11047-013-9397-2 (Springer)
33 · J14Asymptotic Behaviour and Ratios of Complexity in Cellular Automata Rule SpacesH. ZenilInternational Journal of Bifurcation and Chaos vol. 23, no. 9, 2013. (WSPC)
32 · P19Algorithmic complexity of motifs clusters superfamilies of networksH. Zenil, N.A. Kiani and J. TegnerIEEE International Conference on Bioinformatics and Biomedicine, pp 74 – 76, Shanghai, China 2013.
31 · P18Algorithmic Complexity of Animal Behaviour: From Communication to CognitionH. Zenil International Conference on the Theory and Practice of Natural Computing (TPNC) 2013. Cáceres, Spain, Cáceres, Spain
30 · P17Fractal Dimension of Space-time Diagrams and the Runtime Complexity of Small Turing MachinesJ.J. Joosten, F. Soler-Toscano, H. Zenil In T. Neary and M. Cook (Eds.),Machines, Computations and Universality (MCU 2013), EPTCS 128, 2013, pp. 29-30, [abstract, presentation]
29 · P16Testing Biological Models for Non-linear Sensitivity with a Programmability TestH. Zenil, G. Ball and J. Tegnér In P. Liò, O. Miglino, G. Nicosia, S. Nolfi and M. Pavone (eds),Advances in Artificial Intelligence, ECAL 2013, pp. 1222-1223, MIT Press, 2013. DOI:
28 · J13Turing Patterns with Turing Machines: Emergence and Low-level Structure FormationH. ZenilNatural Computing, vol. 12(2): 291-303, 2013, (Springer)
27 · P15Sparsity of Non-trivial Proving Speed-up in Random Systems of Propositional CalculusS. Hernández-Orozco, F. Hernández-Quiroz and H. Zenil In Paola Bonizzoni, Vasco Brattka, Benedikt Löwe (eds.), The Nature of Computation, Logic, Algorithms, Applications, Proceedings 9th. conference Computability in Europe, CiE 2013.
26 · P14A Turing Test-Inspired Approach to Natural ComputationH. Zenil In G. Primiero and L. De Mol (eds.), Turing in Context II, Historical and Contemporary Research in Logic, Computing Machinery and Artificial Intelligence. Proceedings by the Royal Flemish Academy of Belgium for Science and the Arts, Belgium, 2013.
25 · J12Computation and Universality: Class IV versus Class III Cellular AutomataG.J. Martinez, J.C. Seck-Touh-Mora and H. ZenilJournal of Cellular Automata, vol. 7, no. 5-6, pp. 393-430, 2013. (OCP)
24 · P13A Behavioural Foundation for Natural Computing and a Programmability TestH. Zenil In G. Dodig-Crnkovic and R. Giovagnoli (eds),Computing Nature: Turing Centenary Perspective, Springer SAPERE Series vol. 7, pp. 87-113, 2013.
23 · P12Wolfram’s Classification and Computation in Cellular Automata Classes III and IVG.J. Martinez, J.C. Seck-Touh-Mora and H. Zenil In H. Zenil (ed), Irreducibility and Computational Equivalence: Wolfram Science 10 Years After the Publication of A New Kind of ScienceSpringer, 2013
22 · J11Some Aspects of Computation Essential to Evolution and LifeH. Zenil and J.A.R. MarshallUbiquity, vol. 2013, no. April, pp 1-16. (ACM)
21 · P11El Universo AlgorítmicoH. Zenil In, O. Miramontes and K. Volke (eds.) Fronteras de la Física en el Siglo XXI, CopIt arXivesUNAM, 2013
20 · J10Life as Thermodynamic Evidence of Algorithmic Structure in Natural EnvironmentsH. Zenil, C. Gershenson, J.A.R. Marshall and D. RosenbluethEntropy, 14(11), 2173-2191, 2012. (MDPI)
19 · J9What is Nature-like Computation? A Behavioural Approach and a Notion of ProgrammabilityH. ZenilPhilosophy & Technology, vol 27-3, pp 399–421, 2014. 2012). (Springer)
18 · J8Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS?N. Gauvrit, J.-P. Delahaye and H. ZenilJournal of Humanistic Mathematics, vol. 3, no. 1, pp. 3-19, 2013. [preprint, featured in Numberphile] (Claremont College)
17 · J7On the Dynamic Qualitative Behaviour of Universal ComputationH. ZenilComplex Systems, 20-3, pp 265-277, 2012.
16 · J6Numerical Evaluation of Algorithmic Complexity of Short Strings: A Glance Into the Innermost Structure of Algorithmic RandomnessJ.-P. Delahaye and H. Zenil#^Applied Mathematics and Computation 219, pp. 63-77, 2012. (2011) (Elsevier)
15 · J5Empirical Encounters with Computational Irreducibility and UnpredictabilityH. Zenil, F. Soler-Toscano and J.J. JoostenMinds and Machines, vol. 22, Number 3, pp. 149-165, 2012.(Springer)
14 · J4Image Characterization and Classification by Physical ComplexityH. Zenil, J.-P. Delahaye and C. GaucherelComplexity, vol. 17-3, pages 26-42, 2012. (Wiley)
13 · P10From Computer Runtimes to the Length of Proofs: With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem ProvingH. Zenil In M.J. Dinneen, B. Khousainov, and A. Nies (Eds.),Computation, Physics and Beyond International Workshop on Theoretical Computer Science, WTCS 2012, LNCS 7160, pp. 223-240, Springer, 2012.
12 · J3Program-size versus Time complexity, Slowdown and speed-up phenomena in the micro-cosmos of small Turing machinesJ.J. Joosten, F. Soler Toscano and H. Zenil#International Journal of Unconventional Computing, vol. 7, no. 5, pp. 353-387, 2011. (OCP)
11 · J2An Algorithmic Information-theoretic Approach to the Behaviour of Financial MarketsH. Zenil and J.-P. DelahayeJournal of Economic Surveys, vol. 25-3, pp. 431-463, 2011. (Wiley)
10 · P9Fractal Dimension as an Indication of the Terminating Runtime of Discrete Dynamical SystemsJ.J. Joosten, H. Zenil and F. Soler-Toscano In S. Thurner M. Szell (eds), Löcker Verlag,European Conference on Complex Systems (ECCS’11), 2011.
9 · P8Un método estable para la evaluación de la complejidad algorítmica de cadenas cortas (A Stable Method for the Evaluation of the Algorithmic Complexity of Short Strings).H. Zenil, and J.-P. Delahaye In G.J. Martinez, H. Zenil and C.R. Stevens (eds), Complex Systems as Computing ModelsLuniver Press, 2011.
8 · P7Complejidad descriptiva y computacional en máquinas de Turing pequeñasJ.J. Joosten, F. Soler-Toscano, H. Zenil# In Lógica Universal e Unidade da CiênciaCentro de Filosofia das Ciências da Universidade de Lisboa, pp. 11–32, 2011.
7 · P6An Algorithmic Information-theoretic Approach to the Behaviour of Financial Markets.H. Zenil and J.-P. Delahaye In S. Zambelli, D.A.R. George (eds.) Nonlinearity, Complexity and Randomness in Economics: Towards Algorithmic Foundations for EconomicsWiley-Blackwell, 2011.
6 · P5Complejidad descriptiva y computacional en máquinas de Turing pequeñasJ.J. Joosten, F. Soler-Toscano and H. Zenil Actas de las V Jornadas Ibéricas, Lógica Universal e Unidade da CiênciaCFCU 2010.
5 · P4Program-size versus Time complexity, Slowdown and speed-up phenomena in the micro-cosmos of small Turing machines
4 · P3On the Algorithmic Nature of the WorldH. Zenil and J-P. Delahaye In G. Dodig-Crnkovic and M. Burgin (eds), Information and ComputationWorld Scientific Publishing Company, 2010.
3 · J1Compression-based Investigation of the Dynamical Properties of Cellular Automata and Other SystemsH. ZenilComplex Systems, vol. 19, No. 1, pp. 1-28, 2010.
2 · P2On the Kolmogorov-Chaitin complexity for short sequencesJ-P. Delahaye and H. Zenil# In C. Calude (ed) Randomness and Complexity: From Leibniz to ChaitinWorld Scientific Publishing Company, 2007.
1 · P1On the Possible Computational Power of the Human MindH. Zenil and F. Hernandez-Quiroz InWorldviews, Science and Us, Philosophy and Complexity, C. Gershenson, D. Aerts, and B. Edmonds (eds), World Scientific Publishing Company, 2007.
Granted Patents
- Portable device for imaging biological samples — H. Zenil, U.S. Patent 11175230, November 2021
- Wafer for carrying biological sample — H. Zenil, U.S. Patent 11534751, United States, December 2022
Theses
- L’approche algorithmique de l’aléatoire, thesis fulfilling the dissertation requirement for the Degree of Doctor of Philosophy under the direction of J. Mosconi, University of Paris 1 Panthéon-Sorbonne (IHPST/ENS Ulm/CNRS) 2015, with highest honours (très honorable). (Examiners: Andrew Adamatzky, Barry Cooper, Jean-Paul Delahaye and Cyrille Imbert). jury report and thesis online here
- Une approche experimentale à la théorie algorithmique de la complexité, doctoral dissertation, Computer Science, under supervision of J.-P. Delahaye and Cristian S. Calude (Examiners: Gregory Chaitin, Serge Grigorieff, Philippe Mathieu and Hervé Zwirn), University of Lille 1, 2011, with highest honours (très honorable). DOI 10.1.1.397.6875. All chapters were published as papers and are available sections papers and chapters above. jury report, thesis online, alternative source
- Calcul et hyper calcul, (mémoire) fulfilling the dissertation requirement for the degree of Masters (Logic) under the direction of Jacques Dubucs at the University of Paris 1 Panthéon-Sorbonne, 2006. 16/20.
- Encaje de las Redes Neuronales Recurrentes Analógicas en la Jerarquía Aritmética fulfilling the requirement for the B.Sc. (Math) degree, under advice of F. Hernández-Quiroz, Facultad de Ciencias, UNAM, 2005.online
Selected Essays and Reviews
- H. Zenil, A Review and Introduction to New Aspects of Digital and Computational Approaches to Human and AI EthicsPDF
- H. Zenil, The Seemingly Contradictory Philosophical Legacy of Turing and Shannon, AISB Quarterly no. 138 pp. 9–15, 2014. PDF
- H. Zenil, Complejidad y Aleatoriedad, Ciencia (número especial de Turing), Academia Mexicana de Ciencias, vol 64-4, 2013. online. The outstanding cover of the special issue here. And the full article here.
- A. German and H. Zenil, Afterword to Konrad Zuse’s Calculating Space (Rechnender Raum)–The MIT translation–In A Computable Universe, World Scientific, 2012. PDF
- H. Zenil, Introducing the Computable Universe, Introduction to A Computable Universe (foreword by Roger Penrose), World Scientific, 2012. PDF
- H. Zenil, An Algorithmic Approach to Information and Meaning, APA Newsletter on Philosophy and Computers, vol. 11, No. 1, 2011.
- H. Zenil, Information Theory and Computational Thermodynamics: Lessons for Biology from Physics, Information 3, no. 4: 739-750, 2012. online DOI: :10.3390/info3040739
- H. Zenil, The Complexity of Simple Programs: Workshop Report from Cork, Ireland, Bulletin of the European Association for Theoretical Computer Science (BEATCS), 2009.
- H. Zenil, The World is Either Algorithmic or Mostly Random, winning 3rd. Place in the International Essay Context of the FQXi, 2011. PDF
Software
Network and Computational Biology
- Cospectrality and duality (forthcoming)
- Complex Networks (random, scale-free and small world)
- Breadth-First Search Enumeration
- Euler’s Polyhedral Formula
- World Metro Networks
- Generating Random DNA Sequences (with GC content per species)
- Network motifs and graphlets
Discrete Math, Mathematical Logic & Combinatorics
Information Theory, Computational Lingustics & Complexity Theory
- Shannon’s Noisy-Channel Coding Theorem
- Cellular Automaton Compressibility
- Kolmogorov Complexity of 3×3 and 4×4 Squares
- Prediction and Entropy of Languages
- Zipf’s Law Applied to Word and Letter Frequencies
- Multilanguage Word Lengths
- Borel’s Infinite Money Theorem and Algorithmic Probability
- Speedup and Slowdown Phenomena in Turing Machines
- Fractal Dimension versus Time Computational Complexity in Turing Machines
- Complexity: an R-package to enable measures of algorithmic complexity (with N.Gauvrit, H.Singmann and F.Soler)
- Block Decomposition Method (soon available in Perl, Python, Java, C++, Pascal and Mathematica, w/F.Soler)
Automata, Normality & Pseudorandomness
- Busy Beaver Turing Machines
- John von Neumann’s First Pseudorandom Number Generator(middle-square method)
- Random Number Generation and Testing
- Country Data and Benford’s Law
- Champernowne Constant
- Prime Numbers Gaps
- Collatz Sequence Paths
- Distribution of Primes
- Digit Frequencies in the Copeland-Erdos Constant
- Unveiling Mathematica’s TuringMachine Function Step by Step
- Small Turing Machines with Halting State: Enumeration and Running on a Blank Tape
