14 citations · 14 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2024
An additively optimal interpreter for approximating Kolmogorov prefix complexity
Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernandez-Quiroz
We study practical approximations to Kolmogorov prefix complexity (K) using IMP2, a high-level programming language. Our focus is on investigating the interpreter optimality for th…
cs.IT2017
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…