Santiago Hernández-Orozco

According to our database1, Santiago Hernández-Orozco authored at least 11 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution.
CoRR, 2024

2020
Shortening of Proof Length is Elusive for Theorem Provers.
Parallel Process. Lett., 2020

Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.
Frontiers Artif. Intell., 2020

2019
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability.
Int. J. Parallel Emergent Distributed Syst., 2019

Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces.
CoRR, 2019

2018
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
Entropy, 2018

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence.
Artif. Life, 2018

2017
Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, modularity, diversity explosions, and mass extinction.
CoRR, 2017

2016
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
CoRR, 2016

The Limits of Decidable States on Open-Ended Evolution and Emergence.
Proceedings of the Fifteenth International Conference on the Simulation and Synthesis of Living Systems, 2016

2015
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value.
CoRR, 2015


  Loading...