On Algorithmic Complexity, Universal Priors and Ockham's Razor

Authors

  • Brani Vidakovic Institute of Statistics and Decision Sciences, Duke University

DOI:

https://doi.org/10.11606/resimeusp.v3i4.74879

Keywords:

Recursive functions

Abstract

The first part of this paper is a review of basic notions and results connected with Kolmogorov complexity theory.

Downloads

Download data is not yet available.

Downloads

Issue

Vol. 3 No. 4 (1998)

Section

Contents

How to Cite

On Algorithmic Complexity, Universal Priors and Ockham’s Razor. (2014). Resenhas Do Instituto De Matemática E Estatística Da Universidade De São Paulo, 3(4), 359-390. https://doi.org/10.11606/resimeusp.v3i4.74879