The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
The Redundancy of a Computable Code on a Noncomputable Distribution
[article]

2009
*
arXiv
*
pre-print

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of sequences may be singled out almost surely with respect to certain probability measures. Consider a measure parameterized with a real parameter and put an arbitrary prior on the parameter. The Bayesian measure is the expectation of the parameterized measure

arXiv:0901.2321v2
fatcat:pdela2toybhfzj5skj3n7hospa