0.25
0.5
0.75
1.25
1.5
1.75
2
Bad Universal Priors and Notions of Optimality
Published on Aug 20, 20151542 Views
A big open question of algorithmic information theory is the choice of the universal Turing machine (UTM). For Kolmogorov complexity and Solomonoff induction we have invariance theorems: the choice of
Related categories
Chapter list
Bad Universal Priors and Notions of Optimality00:00
RL in Unknown Computable Environments - 100:01
RL in Unknown Computable Environments - 200:25
The Optimality of AIXI01:18
Does AIXI still work?03:39
References04:43