Skip navigation
Skip navigation

On generalized computable universal priors and their convergence

Hutter, Marcus


Solomonoff unified Occam's razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the posterior of the universal semimeasure M converges rapidly to the true sequence generating posterior μ, if the latter is computable. Hence, M is eligible as a universal predictor in case of unknown μ. The first part of the paper investigates the existence...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Theoretical Computer Science
DOI: 10.1016/j.tcs.2006.07.039


File Description SizeFormat Image
Hutter On generalized computable universal 2006.pdf272.01 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator