Equivalence of Universal Priors

Ian Wood (SoCS CECS)

CS HDR MONITORING AI Research Group

DATE: 2010-04-16
TIME: 11:50:00 - 12:20:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
In the literature on algorithmic information theory, 3 distinct definitions of universal priors have been given: the original characterisation by Solomonoff, an enumerable mixture of all enumerable semimeasures and an enumerable semimeasure that dominates all other enumerable semimeasures. I show the equivalence of the first 2 definitions and pose the question of their equivalence with the third.

BIO:
PhD student in Computer Science.