Publications


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

Granted Patents


  1. Portable device for imaging biological samples — H. Zenil, U.S. Patent 11175230, November 2021
  2. Wafer for carrying biological sample — H. Zenil, U.S. Patent 11534751, United States, December 2022

Theses


  1. 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
  2. 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
  3. 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.
  4. 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


  1. H. Zenil, A Review and Introduction to New Aspects of Digital and Computational Approaches to Human and AI EthicsPDF
  2. H. Zenil, The Seemingly Contradictory Philosophical Legacy of Turing and Shannon, AISB Quarterly no. 138 pp. 9–15, 2014. PDF
  3. 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.
  4. 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
  5. H. Zenil, Introducing the Computable Universe, Introduction to A Computable Universe (foreword by Roger Penrose), World Scientific, 2012. PDF
  6. H. Zenil, An Algorithmic Approach to Information and Meaning, APA Newsletter on Philosophy and Computers, vol. 11, No. 1, 2011.
  7. H. Zenil, Information Theory and Computational Thermodynamics: Lessons for Biology from Physics, Information 3, no. 4: 739-750, 2012. online DOI: :10.3390/info3040739
  8. H. Zenil, The Complexity of Simple Programs: Workshop Report from Cork, Ireland, Bulletin of the European Association for Theoretical Computer Science (BEATCS), 2009.
  9. 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

  1. Cospectrality and duality (forthcoming)
  2. Complex Networks (random, scale-free and small world)
  3. Breadth-First Search Enumeration
  4. Euler’s Polyhedral Formula
  5. World Metro Networks
  6. Generating Random DNA Sequences (with GC content per species)
  7. Network motifs and graphlets

Discrete Math, Mathematical Logic & Combinatorics

  1. Truth Tables
  2. Fundamental Theorem of Arithmetic
  3. Golden Ratio by the Fibonacci Sequence
  4. Visualizing the Goldbach Conjecture
  5. Predicate Calculus Formula Generator
  6. Skolemization of Quantified Formulae
  7. Applying the Pólya-Burnside Enumeration Theorem

Information Theory, Computational Lingustics & Complexity Theory

  1. Shannon’s Noisy-Channel Coding Theorem
  2. Cellular Automaton Compressibility
  3. Kolmogorov Complexity of 3×3 and 4×4 Squares
  4. Prediction and Entropy of Languages
  5. Zipf’s Law Applied to Word and Letter Frequencies
  6. Multilanguage Word Lengths
  7. Borel’s Infinite Money Theorem and Algorithmic Probability
  8. Speedup and Slowdown Phenomena in Turing Machines
  9. Fractal Dimension versus Time Computational Complexity in Turing Machines
  10. Complexity: an R-package to enable measures of algorithmic complexity (with N.Gauvrit, H.Singmann and F.Soler)
  11. Block Decomposition Method (soon available in Perl, Python, Java, C++, Pascal and Mathematica, w/F.Soler)

Automata, Normality & Pseudorandomness

  1. Busy Beaver Turing Machines
  2. John von Neumann’s First Pseudorandom Number Generator(middle-square method)
  3. Random Number Generation and Testing
  4. Country Data and Benford’s Law
  5. Champernowne Constant
  6. Prime Numbers Gaps
  7. Collatz Sequence Paths
  8. Distribution of Primes
  9. Digit Frequencies in the Copeland-Erdos Constant
  10. Unveiling Mathematica’s TuringMachine Function Step by Step
  11. Small Turing Machines with Halting State: Enumeration and Running on a Blank Tape