2 citations · 6 across the 4 of their papers we have counts for
6 papers
Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces
Santiago Hernández-Orozco, Hector Zenil, Jürgen Riedel +3
We show how complexity theory can be introduced in machine learning to help bring together apparently disparate areas of current research. We show that this new approach requires l…
Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability
Hector Zenil, Liliana Badillo, Santiago Hernández-Orozco +1
Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/infe…
Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity
Santiago Hernández-Orozco, Narsis A. Kiani, Hector Zenil
Natural selection explains how life has evolved over millions of years from more primitive forms. The speed at which this happens, however, has sometimes defied formal explanations…
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
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic com…
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence
Santiago Hernández-Orozco, Francisco Hernández-Quiroz, Hector Zenil
Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended…
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…