On Algorithmic Complexity, Universal Priors and Ockham's Razor

Authors

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

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.

References

Downloads

Published

1998-03-17

Issue

Vol. 3 No. 4 (1998)

Section

Contents

License

Copyright (c) 1998 Brani Vidakovic

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

How to Cite

On Algorithmic Complexity, Universal Priors and Ockham’s Razor. (1998). 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