[1]
“On Algorithmic Complexity, Universal Priors and Ockham’s Razor”, Resen. Inst. Mat. Estat. Univ. São Paulo, vol. 3, nº 4, p. 359–390, mar. 2014, doi: 10.11606/resimeusp.v3i4.74879.