Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Universal Convergence of Semimeasures on Individual Random Sequences

Thumbnail Image

Date

2004

Authors

Hutter, Marcus
Muchnik, Andrej

Journal Title

Journal ISSN

Volume Title

Publisher

Springer

Abstract

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior μ, if the latter is computable. Hence, M is eligible as a universal sequence pr

Description

Keywords

Keywords: Computational complexity; Convergence of numerical methods; Function evaluation; Markov processes; Probability; Set theory; Theorem proving; Hellinger distance; Kolmogorov complexity; Random sequences; Semimeasures; Random processes

Citation

URI

http://hdl.handle.net/1885/57996

Collections

ANU Research Publications

Source

Algorithmic Learning Theory: 15th International Conference, ALT 2004, Pedova, Italy, October 2004, Proceedings

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Hutter_Universal_Convergence_of_2004.pdf (256.4 KB)

DSpace software copyright © 2002-2026 LYRASIS

abcd