Computable model discovery and high-level-programming approximations to algorithmic complexity. - Vladimir Lemus; Eduardo Acuña-Yeomans; Víctor Zamora; Francisco Hernández Quiroz; Hector Zenil (Theor. Comput. Sci., 2022)

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity. - Zoe Leyva-Acosta; Eduardo Acuña-Yeomans; Francisco Hernández Quiroz (Entropy, 2024)