On Algorithmic Complexity, Universal Priors and Ockham’s Razor. Resen. Inst. Mat. Estat. Univ. São Paulo [Internet]. 2014 Mar. 17 [cited 2024 May 27];3(4):359-90. Available from: https://revistas.usp.br/resenhasimeusp/article/view/74879